/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/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:42:18,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:42:18,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:42:18,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:42:18,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:42:18,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:42:18,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:42:18,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:42:18,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:42:18,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:42:18,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:42:18,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:42:18,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:42:18,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:42:18,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:42:18,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:42:18,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:42:18,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:42:18,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:42:18,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:42:18,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:42:18,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:42:18,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:42:18,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:42:18,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:42:18,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:42:18,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:42:18,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:42:18,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:42:18,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:42:18,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:42:18,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:42:18,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:42:18,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:42:18,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:42:18,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:42:18,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:42:18,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:42:18,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:42:18,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:42:18,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:42:18,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:42:18,468 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:18,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:42:18,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:42:18,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:42:18,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:42:18,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:42:18,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:42:18,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:42:18,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:42:18,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:18,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:42:18,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:42:18,486 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:42:18,486 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:42:18,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:42:18,486 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:42:18,486 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:18,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:42:18,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:42:18,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:42:18,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:42:18,783 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:42:18,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2022-04-28 02:42:18,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b4a7327/cffb568dc74a4e3a9c771f3d67dbae3b/FLAG27c582779 [2022-04-28 02:42:19,269 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:42:19,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-28 02:42:19,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b4a7327/cffb568dc74a4e3a9c771f3d67dbae3b/FLAG27c582779 [2022-04-28 02:42:19,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3b4a7327/cffb568dc74a4e3a9c771f3d67dbae3b [2022-04-28 02:42:19,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:42:19,666 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:42:19,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:19,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:42:19,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:42:19,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:19" (1/1) ... [2022-04-28 02:42:19,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a50ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:19, skipping insertion in model container [2022-04-28 02:42:19,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:42:19" (1/1) ... [2022-04-28 02:42:19,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:42:19,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:42:19,843 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/sum01-1.i[808,821] [2022-04-28 02:42:19,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:19,875 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:42:19,891 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/sum01-1.i[808,821] [2022-04-28 02:42:19,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:42:19,911 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:42:19,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:19 WrapperNode [2022-04-28 02:42:19,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:42:19,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:42:19,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:42:19,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:42:19,921 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:19" (1/1) ... [2022-04-28 02:42:19,921 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:19" (1/1) ... [2022-04-28 02:42:19,926 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:19" (1/1) ... [2022-04-28 02:42:19,926 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:19" (1/1) ... [2022-04-28 02:42:19,931 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:19" (1/1) ... [2022-04-28 02:42:19,935 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:19" (1/1) ... [2022-04-28 02:42:19,936 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:19" (1/1) ... [2022-04-28 02:42:19,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:42:19,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:42:19,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:42:19,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:42:19,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:19" (1/1) ... [2022-04-28 02:42:19,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:42:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:19,977 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:19,998 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:20,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:42:20,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:42:20,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:42:20,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:42:20,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:42:20,022 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:42:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:42:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 02:42:20,023 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 02:42:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:42:20,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:42:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:42:20,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:42:20,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:42:20,087 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:42:20,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:42:20,194 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:42:20,200 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:42:20,201 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:42:20,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:20 BoogieIcfgContainer [2022-04-28 02:42:20,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:42:20,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:42:20,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:42:20,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:42:20,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:42:19" (1/3) ... [2022-04-28 02:42:20,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a06331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:20, skipping insertion in model container [2022-04-28 02:42:20,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:42:19" (2/3) ... [2022-04-28 02:42:20,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a06331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:42:20, skipping insertion in model container [2022-04-28 02:42:20,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:42:20" (3/3) ... [2022-04-28 02:42:20,210 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2022-04-28 02:42:20,222 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:42:20,223 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:42:20,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:42:20,266 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@309f93fc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21633fa9 [2022-04-28 02:42:20,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:42:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:42:20,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:20,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:20,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-28 02:42:20,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190629937] [2022-04-28 02:42:20,302 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-28 02:42:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:20,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199799530] [2022-04-28 02:42:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:20,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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:20,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:20,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:42:20,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:20,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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:20,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 02:42:20,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-28 02:42:20,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-28 02:42:20,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-28 02:42:20,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 02:42:20,521 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-28 02:42:20,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 02:42:20,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 02:42:20,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 02:42:20,522 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:20,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:20,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199799530] [2022-04-28 02:42:20,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199799530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:20,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:20,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:20,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:20,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190629937] [2022-04-28 02:42:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190629937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:20,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:20,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:42:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081042161] [2022-04-28 02:42:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:20,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:20,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:20,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:42:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:42:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:42:20,603 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,716 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-28 02:42:20,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:42:20,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 02:42:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 02:42:20,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-28 02:42:20,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:20,800 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:42:20,801 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 02:42:20,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:42:20,810 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:20,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:42:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 02:42:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 02:42:20,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:20,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,849 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,849 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,856 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 02:42:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:20,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:20,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 02:42:20,857 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 02:42:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:20,861 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-28 02:42:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:20,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:20,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:20,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:20,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 02:42:20,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 02:42:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:20,865 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 02:42:20,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:20,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 02:42:20,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:42:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:42:20,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:20,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:20,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:42:20,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-28 02:42:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:20,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038006725] [2022-04-28 02:42:20,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:42:20,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-28 02:42:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:20,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662992328] [2022-04-28 02:42:20,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:20,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:21,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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); {149#true} is VALID [2022-04-28 02:42:21,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 02:42:21,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 02:42:21,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:21,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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); {149#true} is VALID [2022-04-28 02:42:21,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-28 02:42:21,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-28 02:42:21,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-28 02:42:21,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:21,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-28 02:42:21,053 INFO L272 TraceCheckUtils]: 7: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:21,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:21,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-28 02:42:21,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-28 02:42:21,054 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:21,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662992328] [2022-04-28 02:42:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662992328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:21,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:21,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:21,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:21,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038006725] [2022-04-28 02:42:21,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038006725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:21,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:21,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:42:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353369563] [2022-04-28 02:42:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:21,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:21,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:21,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:42:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:21,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:42:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 02:42:21,077 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:21,266 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:42:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:42:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 02:42:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 02:42:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-28 02:42:21,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-28 02:42:21,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:21,309 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:42:21,309 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:42:21,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:42:21,313 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:21,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:42:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 02:42:21,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:21,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,324 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,324 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:21,326 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:42:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:42:21,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:21,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:21,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:42:21,329 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 02:42:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:21,331 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:42:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:42:21,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:21,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:21,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:21,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 02:42:21,334 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 02:42:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:21,334 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 02:42:21,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:21,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 02:42:21,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:42:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 02:42:21,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:21,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:21,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:42:21,363 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-28 02:42:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:21,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000846288] [2022-04-28 02:42:22,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:22,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash -994786162, now seen corresponding path program 1 times [2022-04-28 02:42:22,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:22,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681111052] [2022-04-28 02:42:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:22,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(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); {278#true} is VALID [2022-04-28 02:42:22,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-28 02:42:22,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-28 02:42:22,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:22,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(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); {278#true} is VALID [2022-04-28 02:42:22,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-28 02:42:22,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-28 02:42:22,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2022-04-28 02:42:22,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:42:22,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [51] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10)) (.cse1 (= v_main_~sn~0_7 v_main_~sn~0_6)) (.cse2 (= |v_main_#t~post2_4| |v_main_#t~post2_3|))) (or (and (< v_main_~i~0_10 11) (< v_main_~i~0_11 v_main_~i~0_10) (<= v_main_~i~0_10 (+ v_main_~n~0_6 1)) (= (+ v_main_~sn~0_6 (* v_main_~i~0_11 2)) (+ v_main_~sn~0_7 (* v_main_~i~0_10 2)))) (and .cse0 .cse1 .cse2 (or (not (<= v_main_~i~0_11 v_main_~n~0_6)) (not (< v_main_~i~0_11 10)))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_11, main_#t~post2=|v_main_#t~post2_4|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_#t~post2=|v_main_#t~post2_3|, main_~n~0=v_main_~n~0_6, main_~sn~0=v_main_~sn~0_6} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {284#(or (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)) (and (<= main_~sn~0 (* main_~n~0 2)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (not (<= (+ main_~sn~0 1) (* main_~n~0 2))))))} is VALID [2022-04-28 02:42:22,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(or (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)) (and (<= main_~sn~0 (* main_~n~0 2)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (not (<= (+ main_~sn~0 1) (* main_~n~0 2))))))} [50] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {285#(or (and (<= main_~sn~0 (* main_~n~0 2)) (< (* main_~n~0 2) (+ main_~sn~0 1))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:42:22,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {285#(or (and (<= main_~sn~0 (* main_~n~0 2)) (< (* main_~n~0 2) (+ main_~sn~0 1))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {286#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:22,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {287#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:22,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {279#false} is VALID [2022-04-28 02:42:22,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-04-28 02:42:22,279 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:22,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:22,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681111052] [2022-04-28 02:42:22,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681111052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:22,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:22,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 02:42:22,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000846288] [2022-04-28 02:42:22,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000846288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:22,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:22,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:42:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994365181] [2022-04-28 02:42:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:22,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-28 02:42:22,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:22,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:22,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:22,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:42:22,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:42:22,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 02:42:22,496 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:22,977 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-28 02:42:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:42:22,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-28 02:42:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:42:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2022-04-28 02:42:22,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2022-04-28 02:42:23,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:23,021 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:42:23,021 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:42:23,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:42:23,022 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:23,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:42:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 02:42:23,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:23,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,038 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,039 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:23,040 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:42:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 02:42:23,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:23,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:23,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:42:23,041 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 02:42:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:23,043 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:42:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 02:42:23,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:23,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:23,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:23,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 02:42:23,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-28 02:42:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:23,045 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 02:42:23,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:23,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 02:42:23,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 02:42:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:42:23,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:23,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:42:23,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2046664786, now seen corresponding path program 1 times [2022-04-28 02:42:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:23,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994784938] [2022-04-28 02:42:27,265 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:27,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:27,831 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:27,833 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 566608365, now seen corresponding path program 1 times [2022-04-28 02:42:27,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:27,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334015299] [2022-04-28 02:42:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {467#(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); {457#true} is VALID [2022-04-28 02:42:28,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:42:28,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #47#return; {457#true} is VALID [2022-04-28 02:42:28,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:28,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {467#(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); {457#true} is VALID [2022-04-28 02:42:28,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:42:28,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #47#return; {457#true} is VALID [2022-04-28 02:42:28,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret3 := main(); {457#true} is VALID [2022-04-28 02:42:28,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:28,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse1 (<= 10 v_main_~i~0_18)) (.cse0 (= v_main_~i~0_18 v_main_~i~0_17))) (or (and (= |v_main_#t~post2_8| |v_main_#t~post2_10|) .cse0 (or (not .cse1) (not (<= v_main_~i~0_18 v_main_~n~0_8)))) (and .cse1 (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 (+ v_main_~n~0_8 1))) (and (= |v_main_#t~post2_10| |v_main_#t~post2_8|) .cse0 (= v_main_~n~0_8 v_main_~n~0_8)))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post2=|v_main_#t~post2_10|, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:28,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:28,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= v_main_~n~0_9 v_main_~n~0_9) .cse0 .cse1 (= |v_main_#t~post2_13| |v_main_#t~post2_9|)) (and (= |v_main_#t~post2_9| |v_main_#t~post2_13|) .cse0 .cse1 (or (not (< v_main_~i~0_20 10)) (not (<= v_main_~i~0_20 v_main_~n~0_9)))) (and (< v_main_~i~0_20 v_main_~i~0_19) (<= v_main_~i~0_19 (+ v_main_~n~0_9 1)) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13)) (< v_main_~i~0_19 11)))) InVars {main_~i~0=v_main_~i~0_20, main_#t~post2=|v_main_#t~post2_13|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_14} OutVars{main_~i~0=v_main_~i~0_19, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_13} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {463#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:42:28,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {463#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {464#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:28,074 INFO L272 TraceCheckUtils]: 10: Hoare triple {464#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {465#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:28,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {465#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {466#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:28,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {458#false} is VALID [2022-04-28 02:42:28,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 02:42:28,076 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:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334015299] [2022-04-28 02:42:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334015299] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258177650] [2022-04-28 02:42:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:28,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:28,083 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:28,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 02:42:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:42:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:28,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:29,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-28 02:42:29,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #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); {457#true} is VALID [2022-04-28 02:42:29,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:42:29,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #47#return; {457#true} is VALID [2022-04-28 02:42:29,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret3 := main(); {457#true} is VALID [2022-04-28 02:42:29,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:29,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse1 (<= 10 v_main_~i~0_18)) (.cse0 (= v_main_~i~0_18 v_main_~i~0_17))) (or (and (= |v_main_#t~post2_8| |v_main_#t~post2_10|) .cse0 (or (not .cse1) (not (<= v_main_~i~0_18 v_main_~n~0_8)))) (and .cse1 (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 (+ v_main_~n~0_8 1))) (and (= |v_main_#t~post2_10| |v_main_#t~post2_8|) .cse0 (= v_main_~n~0_8 v_main_~n~0_8)))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post2=|v_main_#t~post2_10|, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:29,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:29,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(and (= main_~sn~0 0) (= main_~i~0 1))} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= v_main_~n~0_9 v_main_~n~0_9) .cse0 .cse1 (= |v_main_#t~post2_13| |v_main_#t~post2_9|)) (and (= |v_main_#t~post2_9| |v_main_#t~post2_13|) .cse0 .cse1 (or (not (< v_main_~i~0_20 10)) (not (<= v_main_~i~0_20 v_main_~n~0_9)))) (and (< v_main_~i~0_20 v_main_~i~0_19) (<= v_main_~i~0_19 (+ v_main_~n~0_9 1)) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13)) (< v_main_~i~0_19 11)))) InVars {main_~i~0=v_main_~i~0_20, main_#t~post2=|v_main_#t~post2_13|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_14} OutVars{main_~i~0=v_main_~i~0_19, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_13} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {495#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:42:29,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {499#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:42:29,028 INFO L272 TraceCheckUtils]: 10: Hoare triple {499#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:29,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:29,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID [2022-04-28 02:42:29,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 02:42:29,029 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:29,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:30,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-28 02:42:30,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {458#false} is VALID [2022-04-28 02:42:30,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:30,708 INFO L272 TraceCheckUtils]: 10: Hoare triple {464#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:30,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {464#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:30,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= v_main_~n~0_9 v_main_~n~0_9) .cse0 .cse1 (= |v_main_#t~post2_13| |v_main_#t~post2_9|)) (and (= |v_main_#t~post2_9| |v_main_#t~post2_13|) .cse0 .cse1 (or (not (< v_main_~i~0_20 10)) (not (<= v_main_~i~0_20 v_main_~n~0_9)))) (and (< v_main_~i~0_20 v_main_~i~0_19) (<= v_main_~i~0_19 (+ v_main_~n~0_9 1)) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13)) (< v_main_~i~0_19 11)))) InVars {main_~i~0=v_main_~i~0_20, main_#t~post2=|v_main_#t~post2_13|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_14} OutVars{main_~i~0=v_main_~i~0_19, main_#t~post2=|v_main_#t~post2_9|, main_~n~0=v_main_~n~0_9, main_~sn~0=v_main_~sn~0_13} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {526#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:42:30,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:42:30,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {537#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse1 (<= 10 v_main_~i~0_18)) (.cse0 (= v_main_~i~0_18 v_main_~i~0_17))) (or (and (= |v_main_#t~post2_8| |v_main_#t~post2_10|) .cse0 (or (not .cse1) (not (<= v_main_~i~0_18 v_main_~n~0_8)))) (and .cse1 (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 (+ v_main_~n~0_8 1))) (and (= |v_main_#t~post2_10| |v_main_#t~post2_8|) .cse0 (= v_main_~n~0_8 v_main_~n~0_8)))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post2=|v_main_#t~post2_10|, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post2=|v_main_#t~post2_8|, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {530#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:42:30,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {537#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:42:30,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret3 := main(); {457#true} is VALID [2022-04-28 02:42:30,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #47#return; {457#true} is VALID [2022-04-28 02:42:30,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-28 02:42:30,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} #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); {457#true} is VALID [2022-04-28 02:42:30,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2022-04-28 02:42:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:30,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258177650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:30,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:30,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:42:30,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:30,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994784938] [2022-04-28 02:42:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994784938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:30,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:30,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 02:42:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564915275] [2022-04-28 02:42:30,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:30,890 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:42:30,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:30,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:30,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:30,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 02:42:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 02:42:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-04-28 02:42:30,912 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:31,191 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:42:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:42:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:42:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:42:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 02:42:31,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 02:42:31,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:31,226 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:42:31,226 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:42:31,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-04-28 02:42:31,227 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:31,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:42:31,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 02:42:31,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:31,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,249 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,249 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:31,251 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:42:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:42:31,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:31,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:31,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:42:31,252 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 02:42:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:31,253 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:42:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:42:31,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:31,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:31,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:31,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-28 02:42:31,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-28 02:42:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:31,255 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-28 02:42:31,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:31,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-28 02:42:31,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 02:42:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 02:42:31,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:31,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:31,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:31,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:31,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 2 times [2022-04-28 02:42:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:31,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [830763584] [2022-04-28 02:42:31,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:35,988 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:36,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:36,203 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1678826771, now seen corresponding path program 1 times [2022-04-28 02:42:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255597366] [2022-04-28 02:42:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#(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); {720#true} is VALID [2022-04-28 02:42:36,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-28 02:42:36,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {720#true} {720#true} #47#return; {720#true} is VALID [2022-04-28 02:42:36,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {720#true} call ULTIMATE.init(); {730#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:36,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#(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); {720#true} is VALID [2022-04-28 02:42:36,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-28 02:42:36,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {720#true} {720#true} #47#return; {720#true} is VALID [2022-04-28 02:42:36,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {720#true} call #t~ret3 := main(); {720#true} is VALID [2022-04-28 02:42:36,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:36,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [57] L24-3-->L24-4_primed: Formula: (let ((.cse2 (<= 10 v_main_~i~0_36)) (.cse0 (= |v_main_#t~post2_24| |v_main_#t~post2_22|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_36 v_main_~n~0_13)) (not .cse2))) (and .cse2 (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 (+ v_main_~n~0_13 1))) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) .cse1))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post2=|v_main_#t~post2_24|, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post2=|v_main_#t~post2_22|, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:36,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:36,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (<= v_main_~i~0_37 (+ v_main_~n~0_14 1)) (< v_main_~i~0_37 11)) (and .cse0 (= v_main_~n~0_14 v_main_~n~0_14) .cse1 (= |v_main_#t~post2_27| |v_main_#t~post2_23|)) (and .cse0 (or (not (< v_main_~i~0_38 10)) (not (<= v_main_~i~0_38 v_main_~n~0_14))) .cse1 (= |v_main_#t~post2_23| |v_main_#t~post2_27|)))) InVars {main_~i~0=v_main_~i~0_38, main_#t~post2=|v_main_#t~post2_27|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_24} OutVars{main_~i~0=v_main_~i~0_37, main_#t~post2=|v_main_#t~post2_23|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_23} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {726#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:42:36,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {726#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {727#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:42:36,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {727#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {728#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:36,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {728#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {729#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:36,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {729#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {721#false} is VALID [2022-04-28 02:42:36,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-04-28 02:42:36,400 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:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:36,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255597366] [2022-04-28 02:42:36,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255597366] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:36,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462574515] [2022-04-28 02:42:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:36,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:36,402 INFO L229 MonitoredProcess]: Starting monitored process 3 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:36,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 02:42:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:42:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:36,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:37,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {720#true} call ULTIMATE.init(); {720#true} is VALID [2022-04-28 02:42:37,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} #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); {720#true} is VALID [2022-04-28 02:42:37,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-28 02:42:37,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {720#true} {720#true} #47#return; {720#true} is VALID [2022-04-28 02:42:37,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {720#true} call #t~ret3 := main(); {720#true} is VALID [2022-04-28 02:42:37,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:37,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [57] L24-3-->L24-4_primed: Formula: (let ((.cse2 (<= 10 v_main_~i~0_36)) (.cse0 (= |v_main_#t~post2_24| |v_main_#t~post2_22|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_36 v_main_~n~0_13)) (not .cse2))) (and .cse2 (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 (+ v_main_~n~0_13 1))) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) .cse1))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post2=|v_main_#t~post2_24|, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post2=|v_main_#t~post2_22|, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:37,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {725#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:37,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {725#(and (= main_~sn~0 0) (= main_~i~0 1))} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (<= v_main_~i~0_37 (+ v_main_~n~0_14 1)) (< v_main_~i~0_37 11)) (and .cse0 (= v_main_~n~0_14 v_main_~n~0_14) .cse1 (= |v_main_#t~post2_27| |v_main_#t~post2_23|)) (and .cse0 (or (not (< v_main_~i~0_38 10)) (not (<= v_main_~i~0_38 v_main_~n~0_14))) .cse1 (= |v_main_#t~post2_23| |v_main_#t~post2_27|)))) InVars {main_~i~0=v_main_~i~0_38, main_#t~post2=|v_main_#t~post2_27|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_24} OutVars{main_~i~0=v_main_~i~0_37, main_#t~post2=|v_main_#t~post2_23|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_23} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {758#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:42:37,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {758#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {762#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:42:37,442 INFO L272 TraceCheckUtils]: 10: Hoare triple {762#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:37,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:37,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {721#false} is VALID [2022-04-28 02:42:37,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-04-28 02:42:37,445 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:37,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:38,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-04-28 02:42:38,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {721#false} is VALID [2022-04-28 02:42:38,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:38,763 INFO L272 TraceCheckUtils]: 10: Hoare triple {727#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:38,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {727#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:42:38,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (<= v_main_~i~0_37 (+ v_main_~n~0_14 1)) (< v_main_~i~0_37 11)) (and .cse0 (= v_main_~n~0_14 v_main_~n~0_14) .cse1 (= |v_main_#t~post2_27| |v_main_#t~post2_23|)) (and .cse0 (or (not (< v_main_~i~0_38 10)) (not (<= v_main_~i~0_38 v_main_~n~0_14))) .cse1 (= |v_main_#t~post2_23| |v_main_#t~post2_27|)))) InVars {main_~i~0=v_main_~i~0_38, main_#t~post2=|v_main_#t~post2_27|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_24} OutVars{main_~i~0=v_main_~i~0_37, main_#t~post2=|v_main_#t~post2_23|, main_~n~0=v_main_~n~0_14, main_~sn~0=v_main_~sn~0_23} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {789#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:42:38,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {793#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:42:38,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [57] L24-3-->L24-4_primed: Formula: (let ((.cse2 (<= 10 v_main_~i~0_36)) (.cse0 (= |v_main_#t~post2_24| |v_main_#t~post2_22|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_36 v_main_~n~0_13)) (not .cse2))) (and .cse2 (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 (+ v_main_~n~0_13 1))) (and .cse0 (= v_main_~n~0_13 v_main_~n~0_13) .cse1))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post2=|v_main_#t~post2_24|, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post2=|v_main_#t~post2_22|, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {793#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:42:38,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {800#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:42:38,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {720#true} call #t~ret3 := main(); {720#true} is VALID [2022-04-28 02:42:38,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {720#true} {720#true} #47#return; {720#true} is VALID [2022-04-28 02:42:38,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume true; {720#true} is VALID [2022-04-28 02:42:38,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} #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); {720#true} is VALID [2022-04-28 02:42:38,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {720#true} call ULTIMATE.init(); {720#true} is VALID [2022-04-28 02:42:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:38,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462574515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:38,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:38,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:42:38,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [830763584] [2022-04-28 02:42:38,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [830763584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:38,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 02:42:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891007873] [2022-04-28 02:42:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 20 [2022-04-28 02:42:38,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:38,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:38,999 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-28 02:42:38,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 02:42:38,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 02:42:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-04-28 02:42:39,000 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:39,411 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-28 02:42:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 02:42:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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 20 [2022-04-28 02:42:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 02:42:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 02:42:39,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-28 02:42:39,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:39,445 INFO L225 Difference]: With dead ends: 33 [2022-04-28 02:42:39,445 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:42:39,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-04-28 02:42:39,446 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:39,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:42:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:42:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 02:42:39,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:39,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:39,478 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:39,478 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:39,480 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 02:42:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:42:39,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:39,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:39,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:42:39,482 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 02:42:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:39,484 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 02:42:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:42:39,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:39,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:39,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:39,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 02:42:39,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-28 02:42:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:39,493 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 02:42:39,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 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:39,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 02:42:39,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 02:42:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 02:42:39,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:39,528 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:39,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 02:42:39,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:39,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 3 times [2022-04-28 02:42:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:39,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003329608] [2022-04-28 02:42:43,874 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:44,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:44,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:44,341 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash 370705389, now seen corresponding path program 1 times [2022-04-28 02:42:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:44,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724294413] [2022-04-28 02:42:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:44,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1020#(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); {1010#true} is VALID [2022-04-28 02:42:44,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 02:42:44,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1010#true} {1010#true} #47#return; {1010#true} is VALID [2022-04-28 02:42:44,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:44,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1020#(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); {1010#true} is VALID [2022-04-28 02:42:44,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 02:42:44,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #47#return; {1010#true} is VALID [2022-04-28 02:42:44,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret3 := main(); {1010#true} is VALID [2022-04-28 02:42:44,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:44,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [61] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post2_38| |v_main_#t~post2_36|)) (.cse2 (= v_main_~i~0_55 v_main_~i~0_54)) (.cse0 (<= 10 v_main_~i~0_55))) (or (and (or (not .cse0) (not (<= v_main_~i~0_55 v_main_~n~0_18))) .cse1 .cse2) (and (= v_main_~n~0_18 v_main_~n~0_18) .cse1 .cse2) (and .cse0 (<= v_main_~i~0_54 (+ v_main_~n~0_18 1)) (< v_main_~i~0_55 v_main_~i~0_54)))) InVars {main_~i~0=v_main_~i~0_55, main_#t~post2=|v_main_#t~post2_38|, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_54, main_#t~post2=|v_main_#t~post2_36|, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:44,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:44,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse1 (= v_main_~i~0_57 v_main_~i~0_56))) (or (and .cse0 (or (not (< v_main_~i~0_57 10)) (not (<= v_main_~i~0_57 v_main_~n~0_19))) (= |v_main_#t~post2_37| |v_main_#t~post2_41|) .cse1) (and (< v_main_~i~0_56 11) (<= v_main_~i~0_56 (+ v_main_~n~0_19 1)) (= (+ (* v_main_~i~0_57 2) v_main_~sn~0_34) (+ (* v_main_~i~0_56 2) v_main_~sn~0_35)) (< v_main_~i~0_57 v_main_~i~0_56)) (and .cse0 .cse1 (= |v_main_#t~post2_41| |v_main_#t~post2_37|) (= v_main_~n~0_19 v_main_~n~0_19)))) InVars {main_~i~0=v_main_~i~0_57, main_#t~post2=|v_main_#t~post2_41|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_35} OutVars{main_~i~0=v_main_~i~0_56, main_#t~post2=|v_main_#t~post2_37|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_34} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1016#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:42:44,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1016#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1017#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:44,472 INFO L272 TraceCheckUtils]: 10: Hoare triple {1017#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:44,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1019#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:44,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {1019#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 02:42:44,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 02:42:44,473 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:44,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724294413] [2022-04-28 02:42:44,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724294413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:44,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527929881] [2022-04-28 02:42:44,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:44,475 INFO L229 MonitoredProcess]: Starting monitored process 4 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:44,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 02:42:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:42:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:44,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:45,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 02:42:45,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #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); {1010#true} is VALID [2022-04-28 02:42:45,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 02:42:45,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #47#return; {1010#true} is VALID [2022-04-28 02:42:45,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret3 := main(); {1010#true} is VALID [2022-04-28 02:42:45,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:45,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [61] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post2_38| |v_main_#t~post2_36|)) (.cse2 (= v_main_~i~0_55 v_main_~i~0_54)) (.cse0 (<= 10 v_main_~i~0_55))) (or (and (or (not .cse0) (not (<= v_main_~i~0_55 v_main_~n~0_18))) .cse1 .cse2) (and (= v_main_~n~0_18 v_main_~n~0_18) .cse1 .cse2) (and .cse0 (<= v_main_~i~0_54 (+ v_main_~n~0_18 1)) (< v_main_~i~0_55 v_main_~i~0_54)))) InVars {main_~i~0=v_main_~i~0_55, main_#t~post2=|v_main_#t~post2_38|, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_54, main_#t~post2=|v_main_#t~post2_36|, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:45,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:45,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {1015#(and (= main_~sn~0 0) (= main_~i~0 1))} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse1 (= v_main_~i~0_57 v_main_~i~0_56))) (or (and .cse0 (or (not (< v_main_~i~0_57 10)) (not (<= v_main_~i~0_57 v_main_~n~0_19))) (= |v_main_#t~post2_37| |v_main_#t~post2_41|) .cse1) (and (< v_main_~i~0_56 11) (<= v_main_~i~0_56 (+ v_main_~n~0_19 1)) (= (+ (* v_main_~i~0_57 2) v_main_~sn~0_34) (+ (* v_main_~i~0_56 2) v_main_~sn~0_35)) (< v_main_~i~0_57 v_main_~i~0_56)) (and .cse0 .cse1 (= |v_main_#t~post2_41| |v_main_#t~post2_37|) (= v_main_~n~0_19 v_main_~n~0_19)))) InVars {main_~i~0=v_main_~i~0_57, main_#t~post2=|v_main_#t~post2_41|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_35} OutVars{main_~i~0=v_main_~i~0_56, main_#t~post2=|v_main_#t~post2_37|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_34} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1048#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:42:45,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1052#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:42:45,815 INFO L272 TraceCheckUtils]: 10: Hoare triple {1052#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:45,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {1056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:45,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 02:42:45,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 02:42:45,816 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:45,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:47,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-28 02:42:47,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-28 02:42:47,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1056#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1060#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:47,002 INFO L272 TraceCheckUtils]: 10: Hoare triple {1017#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1056#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:47,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1017#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:47,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {1083#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0)))} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse1 (= v_main_~i~0_57 v_main_~i~0_56))) (or (and .cse0 (or (not (< v_main_~i~0_57 10)) (not (<= v_main_~i~0_57 v_main_~n~0_19))) (= |v_main_#t~post2_37| |v_main_#t~post2_41|) .cse1) (and (< v_main_~i~0_56 11) (<= v_main_~i~0_56 (+ v_main_~n~0_19 1)) (= (+ (* v_main_~i~0_57 2) v_main_~sn~0_34) (+ (* v_main_~i~0_56 2) v_main_~sn~0_35)) (< v_main_~i~0_57 v_main_~i~0_56)) (and .cse0 .cse1 (= |v_main_#t~post2_41| |v_main_#t~post2_37|) (= v_main_~n~0_19 v_main_~n~0_19)))) InVars {main_~i~0=v_main_~i~0_57, main_#t~post2=|v_main_#t~post2_41|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_35} OutVars{main_~i~0=v_main_~i~0_56, main_#t~post2=|v_main_#t~post2_37|, main_~n~0=v_main_~n~0_19, main_~sn~0=v_main_~sn~0_34} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1079#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:42:47,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {1083#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0)))} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1083#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0)))} is VALID [2022-04-28 02:42:47,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {1090#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [61] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= |v_main_#t~post2_38| |v_main_#t~post2_36|)) (.cse2 (= v_main_~i~0_55 v_main_~i~0_54)) (.cse0 (<= 10 v_main_~i~0_55))) (or (and (or (not .cse0) (not (<= v_main_~i~0_55 v_main_~n~0_18))) .cse1 .cse2) (and (= v_main_~n~0_18 v_main_~n~0_18) .cse1 .cse2) (and .cse0 (<= v_main_~i~0_54 (+ v_main_~n~0_18 1)) (< v_main_~i~0_55 v_main_~i~0_54)))) InVars {main_~i~0=v_main_~i~0_55, main_#t~post2=|v_main_#t~post2_38|, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_54, main_#t~post2=|v_main_#t~post2_36|, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1083#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 2) (+ main_~i~0 (div (+ (- 1) main_~sn~0) (- 2)))) (<= 10 main_~n~0)))} is VALID [2022-04-28 02:42:47,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1090#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:42:47,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret3 := main(); {1010#true} is VALID [2022-04-28 02:42:47,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #47#return; {1010#true} is VALID [2022-04-28 02:42:47,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-28 02:42:47,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#true} #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); {1010#true} is VALID [2022-04-28 02:42:47,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-28 02:42:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:47,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527929881] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:47,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:47,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:42:47,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:47,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003329608] [2022-04-28 02:42:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003329608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:47,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:47,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 02:42:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66058204] [2022-04-28 02:42:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-28 02:42:47,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:47,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:47,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 02:42:47,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:47,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 02:42:47,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-28 02:42:47,261 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:47,824 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 02:42:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 02:42:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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 23 [2022-04-28 02:42:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-28 02:42:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2022-04-28 02:42:47,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2022-04-28 02:42:47,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:47,862 INFO L225 Difference]: With dead ends: 36 [2022-04-28 02:42:47,862 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 02:42:47,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 02:42:47,863 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:47,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:42:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 02:42:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 02:42:47,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:47,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,892 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,892 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:47,894 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 02:42:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 02:42:47,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:47,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:47,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:42:47,894 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 02:42:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:47,895 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 02:42:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 02:42:47,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:47,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:47,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:47,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 02:42:47,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2022-04-28 02:42:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:47,898 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 02:42:47,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 02:42:47,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 02:42:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 02:42:47,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:47,928 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:47,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:48,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1448012981, now seen corresponding path program 4 times [2022-04-28 02:42:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:48,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [398884065] [2022-04-28 02:42:52,260 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:42:52,360 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:52,648 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:42:52,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:42:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1874729747, now seen corresponding path program 1 times [2022-04-28 02:42:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:42:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052218871] [2022-04-28 02:42:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:42:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:42:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#(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); {1327#true} is VALID [2022-04-28 02:42:52,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-04-28 02:42:52,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1327#true} {1327#true} #47#return; {1327#true} is VALID [2022-04-28 02:42:52,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {1327#true} call ULTIMATE.init(); {1337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:42:52,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#(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); {1327#true} is VALID [2022-04-28 02:42:52,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-04-28 02:42:52,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1327#true} #47#return; {1327#true} is VALID [2022-04-28 02:42:52,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1327#true} call #t~ret3 := main(); {1327#true} is VALID [2022-04-28 02:42:52,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:52,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_75 v_main_~i~0_74)) (.cse1 (= |v_main_#t~post2_52| |v_main_#t~post2_50|)) (.cse2 (<= 10 v_main_~i~0_75))) (or (and .cse0 .cse1 (or (not .cse2) (not (<= v_main_~i~0_75 v_main_~n~0_23)))) (and (= v_main_~n~0_23 v_main_~n~0_23) .cse0 .cse1) (and (< v_main_~i~0_75 v_main_~i~0_74) .cse2 (<= v_main_~i~0_74 (+ v_main_~n~0_23 1))))) InVars {main_~i~0=v_main_~i~0_75, main_#t~post2=|v_main_#t~post2_52|, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_74, main_#t~post2=|v_main_#t~post2_50|, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:52,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:52,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= |v_main_#t~post2_55| |v_main_#t~post2_51|)) (.cse2 (= v_main_~i~0_77 v_main_~i~0_76))) (or (and .cse0 .cse1 (= v_main_~n~0_24 v_main_~n~0_24) .cse2) (and .cse0 .cse1 (or (not (<= v_main_~i~0_77 v_main_~n~0_24)) (not (< v_main_~i~0_77 10))) .cse2) (and (< v_main_~i~0_77 v_main_~i~0_76) (<= v_main_~i~0_76 (+ v_main_~n~0_24 1)) (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_47) (+ (* v_main_~i~0_77 2) v_main_~sn~0_46)) (< v_main_~i~0_76 11)))) InVars {main_~i~0=v_main_~i~0_77, main_#t~post2=|v_main_#t~post2_55|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_47} OutVars{main_~i~0=v_main_~i~0_76, main_#t~post2=|v_main_#t~post2_51|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_46} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1333#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:42:52,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {1333#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1334#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:52,796 INFO L272 TraceCheckUtils]: 10: Hoare triple {1334#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1335#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:42:52,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1336#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:42:52,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {1336#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1328#false} is VALID [2022-04-28 02:42:52,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-04-28 02:42:52,797 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:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:42:52,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052218871] [2022-04-28 02:42:52,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052218871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:42:52,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913571302] [2022-04-28 02:42:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:42:52,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:42:52,799 INFO L229 MonitoredProcess]: Starting monitored process 5 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:52,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 02:42:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:42:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:42:52,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:42:53,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1327#true} call ULTIMATE.init(); {1327#true} is VALID [2022-04-28 02:42:53,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} #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); {1327#true} is VALID [2022-04-28 02:42:53,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-04-28 02:42:53,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1327#true} #47#return; {1327#true} is VALID [2022-04-28 02:42:53,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1327#true} call #t~ret3 := main(); {1327#true} is VALID [2022-04-28 02:42:53,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:53,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_75 v_main_~i~0_74)) (.cse1 (= |v_main_#t~post2_52| |v_main_#t~post2_50|)) (.cse2 (<= 10 v_main_~i~0_75))) (or (and .cse0 .cse1 (or (not .cse2) (not (<= v_main_~i~0_75 v_main_~n~0_23)))) (and (= v_main_~n~0_23 v_main_~n~0_23) .cse0 .cse1) (and (< v_main_~i~0_75 v_main_~i~0_74) .cse2 (<= v_main_~i~0_74 (+ v_main_~n~0_23 1))))) InVars {main_~i~0=v_main_~i~0_75, main_#t~post2=|v_main_#t~post2_52|, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_74, main_#t~post2=|v_main_#t~post2_50|, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:53,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:42:53,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(and (= main_~sn~0 0) (= main_~i~0 1))} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= |v_main_#t~post2_55| |v_main_#t~post2_51|)) (.cse2 (= v_main_~i~0_77 v_main_~i~0_76))) (or (and .cse0 .cse1 (= v_main_~n~0_24 v_main_~n~0_24) .cse2) (and .cse0 .cse1 (or (not (<= v_main_~i~0_77 v_main_~n~0_24)) (not (< v_main_~i~0_77 10))) .cse2) (and (< v_main_~i~0_77 v_main_~i~0_76) (<= v_main_~i~0_76 (+ v_main_~n~0_24 1)) (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_47) (+ (* v_main_~i~0_77 2) v_main_~sn~0_46)) (< v_main_~i~0_76 11)))) InVars {main_~i~0=v_main_~i~0_77, main_#t~post2=|v_main_#t~post2_55|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_47} OutVars{main_~i~0=v_main_~i~0_76, main_#t~post2=|v_main_#t~post2_51|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_46} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1365#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:42:53,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1369#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:42:53,876 INFO L272 TraceCheckUtils]: 10: Hoare triple {1369#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:53,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:53,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1328#false} is VALID [2022-04-28 02:42:53,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-04-28 02:42:53,877 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:53,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:42:54,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-04-28 02:42:54,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1328#false} is VALID [2022-04-28 02:42:54,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:42:54,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {1334#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:42:54,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1396#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1334#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:42:54,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= |v_main_#t~post2_55| |v_main_#t~post2_51|)) (.cse2 (= v_main_~i~0_77 v_main_~i~0_76))) (or (and .cse0 .cse1 (= v_main_~n~0_24 v_main_~n~0_24) .cse2) (and .cse0 .cse1 (or (not (<= v_main_~i~0_77 v_main_~n~0_24)) (not (< v_main_~i~0_77 10))) .cse2) (and (< v_main_~i~0_77 v_main_~i~0_76) (<= v_main_~i~0_76 (+ v_main_~n~0_24 1)) (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_47) (+ (* v_main_~i~0_77 2) v_main_~sn~0_46)) (< v_main_~i~0_76 11)))) InVars {main_~i~0=v_main_~i~0_77, main_#t~post2=|v_main_#t~post2_55|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_47} OutVars{main_~i~0=v_main_~i~0_76, main_#t~post2=|v_main_#t~post2_51|, main_~n~0=v_main_~n~0_24, main_~sn~0=v_main_~sn~0_46} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1396#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:42:54,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1400#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1400#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:42:54,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_75 v_main_~i~0_74)) (.cse1 (= |v_main_#t~post2_52| |v_main_#t~post2_50|)) (.cse2 (<= 10 v_main_~i~0_75))) (or (and .cse0 .cse1 (or (not .cse2) (not (<= v_main_~i~0_75 v_main_~n~0_23)))) (and (= v_main_~n~0_23 v_main_~n~0_23) .cse0 .cse1) (and (< v_main_~i~0_75 v_main_~i~0_74) .cse2 (<= v_main_~i~0_74 (+ v_main_~n~0_23 1))))) InVars {main_~i~0=v_main_~i~0_75, main_#t~post2=|v_main_#t~post2_52|, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_74, main_#t~post2=|v_main_#t~post2_50|, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1400#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:42:54,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {1327#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1407#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:42:54,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {1327#true} call #t~ret3 := main(); {1327#true} is VALID [2022-04-28 02:42:54,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1327#true} {1327#true} #47#return; {1327#true} is VALID [2022-04-28 02:42:54,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#true} assume true; {1327#true} is VALID [2022-04-28 02:42:54,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} #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); {1327#true} is VALID [2022-04-28 02:42:54,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {1327#true} call ULTIMATE.init(); {1327#true} is VALID [2022-04-28 02:42:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:42:54,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913571302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:42:54,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:42:54,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:42:55,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:42:55,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [398884065] [2022-04-28 02:42:55,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [398884065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:42:55,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:42:55,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 02:42:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231596963] [2022-04-28 02:42:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:42:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 26 [2022-04-28 02:42:55,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:42:55,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:55,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:55,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 02:42:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:55,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 02:42:55,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2022-04-28 02:42:55,254 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:55,935 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 02:42:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 02:42:55,935 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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 26 [2022-04-28 02:42:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:42:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 39 transitions. [2022-04-28 02:42:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 39 transitions. [2022-04-28 02:42:55,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 39 transitions. [2022-04-28 02:42:55,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:55,975 INFO L225 Difference]: With dead ends: 39 [2022-04-28 02:42:55,975 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 02:42:55,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1478, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 02:42:55,978 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:42:55,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 74 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:42:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 02:42:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 02:42:56,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:42:56,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,013 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,013 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:56,014 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 02:42:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 02:42:56,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:56,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:56,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:42:56,015 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 02:42:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:42:56,016 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 02:42:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 02:42:56,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:42:56,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:42:56,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:42:56,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:42:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:42:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 02:42:56,017 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-28 02:42:56,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:42:56,018 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 02:42:56,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 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:56,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 02:42:56,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:42:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 02:42:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 02:42:56,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:42:56,051 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:42:56,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 02:42:56,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:42:56,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:42:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:42:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 319282542, now seen corresponding path program 5 times [2022-04-28 02:42:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:42:56,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1702048235] [2022-04-28 02:43:00,423 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:00,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:04,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:04,559 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:43:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 174802413, now seen corresponding path program 1 times [2022-04-28 02:43:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:04,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516507564] [2022-04-28 02:43:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:04,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:04,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {1681#(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); {1671#true} is VALID [2022-04-28 02:43:04,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 02:43:04,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #47#return; {1671#true} is VALID [2022-04-28 02:43:04,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:04,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1681#(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); {1671#true} is VALID [2022-04-28 02:43:04,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 02:43:04,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #47#return; {1671#true} is VALID [2022-04-28 02:43:04,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret3 := main(); {1671#true} is VALID [2022-04-28 02:43:04,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:04,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_66| |v_main_#t~post2_64|)) (.cse2 (= v_main_~i~0_96 v_main_~i~0_95)) (.cse1 (<= 10 v_main_~i~0_96))) (or (and .cse0 (or (not (<= v_main_~i~0_96 v_main_~n~0_28)) (not .cse1)) .cse2) (and (= v_main_~n~0_28 v_main_~n~0_28) .cse0 .cse2) (and (< v_main_~i~0_96 v_main_~i~0_95) (<= v_main_~i~0_95 (+ v_main_~n~0_28 1)) .cse1))) InVars {main_~i~0=v_main_~i~0_96, main_#t~post2=|v_main_#t~post2_66|, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_95, main_#t~post2=|v_main_#t~post2_64|, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:04,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:04,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_98 v_main_~i~0_97))) (or (and (< v_main_~i~0_98 v_main_~i~0_97) (< v_main_~i~0_97 11) (= (+ (* v_main_~i~0_98 2) v_main_~sn~0_59) (+ (* v_main_~i~0_97 2) v_main_~sn~0_60)) (<= v_main_~i~0_97 (+ v_main_~n~0_29 1))) (and (= v_main_~sn~0_59 v_main_~sn~0_60) .cse0 (= |v_main_#t~post2_65| |v_main_#t~post2_69|) (or (not (<= v_main_~i~0_98 v_main_~n~0_29)) (not (< v_main_~i~0_98 10)))) (and .cse0 (= |v_main_#t~post2_69| |v_main_#t~post2_65|) (= v_main_~sn~0_60 v_main_~sn~0_59) (= v_main_~n~0_29 v_main_~n~0_29)))) InVars {main_~i~0=v_main_~i~0_98, main_#t~post2=|v_main_#t~post2_69|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_60} OutVars{main_~i~0=v_main_~i~0_97, main_#t~post2=|v_main_#t~post2_65|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_59} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1677#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:04,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1678#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:04,696 INFO L272 TraceCheckUtils]: 10: Hoare triple {1678#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:43:04,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {1679#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1680#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:43:04,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1680#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1672#false} is VALID [2022-04-28 02:43:04,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 02:43:04,697 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:43:04,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:04,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516507564] [2022-04-28 02:43:04,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516507564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:43:04,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961724221] [2022-04-28 02:43:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:04,699 INFO L229 MonitoredProcess]: Starting monitored process 6 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:43:04,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:43:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:04,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:43:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:04,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:43:05,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-28 02:43:05,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} #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); {1671#true} is VALID [2022-04-28 02:43:05,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 02:43:05,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #47#return; {1671#true} is VALID [2022-04-28 02:43:05,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret3 := main(); {1671#true} is VALID [2022-04-28 02:43:05,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:05,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_66| |v_main_#t~post2_64|)) (.cse2 (= v_main_~i~0_96 v_main_~i~0_95)) (.cse1 (<= 10 v_main_~i~0_96))) (or (and .cse0 (or (not (<= v_main_~i~0_96 v_main_~n~0_28)) (not .cse1)) .cse2) (and (= v_main_~n~0_28 v_main_~n~0_28) .cse0 .cse2) (and (< v_main_~i~0_96 v_main_~i~0_95) (<= v_main_~i~0_95 (+ v_main_~n~0_28 1)) .cse1))) InVars {main_~i~0=v_main_~i~0_96, main_#t~post2=|v_main_#t~post2_66|, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_95, main_#t~post2=|v_main_#t~post2_64|, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:05,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:05,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1676#(and (= main_~sn~0 0) (= main_~i~0 1))} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_98 v_main_~i~0_97))) (or (and (< v_main_~i~0_98 v_main_~i~0_97) (< v_main_~i~0_97 11) (= (+ (* v_main_~i~0_98 2) v_main_~sn~0_59) (+ (* v_main_~i~0_97 2) v_main_~sn~0_60)) (<= v_main_~i~0_97 (+ v_main_~n~0_29 1))) (and (= v_main_~sn~0_59 v_main_~sn~0_60) .cse0 (= |v_main_#t~post2_65| |v_main_#t~post2_69|) (or (not (<= v_main_~i~0_98 v_main_~n~0_29)) (not (< v_main_~i~0_98 10)))) (and .cse0 (= |v_main_#t~post2_69| |v_main_#t~post2_65|) (= v_main_~sn~0_60 v_main_~sn~0_59) (= v_main_~n~0_29 v_main_~n~0_29)))) InVars {main_~i~0=v_main_~i~0_98, main_#t~post2=|v_main_#t~post2_69|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_60} OutVars{main_~i~0=v_main_~i~0_97, main_#t~post2=|v_main_#t~post2_65|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_59} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1709#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:43:05,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {1709#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1713#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:43:05,036 INFO L272 TraceCheckUtils]: 10: Hoare triple {1713#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:05,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:05,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1672#false} is VALID [2022-04-28 02:43:05,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 02:43:05,037 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:43:05,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:43:06,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 02:43:06,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {1721#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1672#false} is VALID [2022-04-28 02:43:06,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1721#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:06,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {1678#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1717#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:06,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1740#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {1678#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:06,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1744#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_98 v_main_~i~0_97))) (or (and (< v_main_~i~0_98 v_main_~i~0_97) (< v_main_~i~0_97 11) (= (+ (* v_main_~i~0_98 2) v_main_~sn~0_59) (+ (* v_main_~i~0_97 2) v_main_~sn~0_60)) (<= v_main_~i~0_97 (+ v_main_~n~0_29 1))) (and (= v_main_~sn~0_59 v_main_~sn~0_60) .cse0 (= |v_main_#t~post2_65| |v_main_#t~post2_69|) (or (not (<= v_main_~i~0_98 v_main_~n~0_29)) (not (< v_main_~i~0_98 10)))) (and .cse0 (= |v_main_#t~post2_69| |v_main_#t~post2_65|) (= v_main_~sn~0_60 v_main_~sn~0_59) (= v_main_~n~0_29 v_main_~n~0_29)))) InVars {main_~i~0=v_main_~i~0_98, main_#t~post2=|v_main_#t~post2_69|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_60} OutVars{main_~i~0=v_main_~i~0_97, main_#t~post2=|v_main_#t~post2_65|, main_~n~0=v_main_~n~0_29, main_~sn~0=v_main_~sn~0_59} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {1740#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:06,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {1744#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1744#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:43:06,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {1751#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_66| |v_main_#t~post2_64|)) (.cse2 (= v_main_~i~0_96 v_main_~i~0_95)) (.cse1 (<= 10 v_main_~i~0_96))) (or (and .cse0 (or (not (<= v_main_~i~0_96 v_main_~n~0_28)) (not .cse1)) .cse2) (and (= v_main_~n~0_28 v_main_~n~0_28) .cse0 .cse2) (and (< v_main_~i~0_96 v_main_~i~0_95) (<= v_main_~i~0_95 (+ v_main_~n~0_28 1)) .cse1))) InVars {main_~i~0=v_main_~i~0_96, main_#t~post2=|v_main_#t~post2_66|, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_95, main_#t~post2=|v_main_#t~post2_64|, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {1744#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:43:06,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {1751#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:43:06,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret3 := main(); {1671#true} is VALID [2022-04-28 02:43:06,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #47#return; {1671#true} is VALID [2022-04-28 02:43:06,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 02:43:06,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} #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); {1671#true} is VALID [2022-04-28 02:43:06,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2022-04-28 02:43:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:43:06,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961724221] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:43:06,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:43:06,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:43:06,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1702048235] [2022-04-28 02:43:06,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1702048235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:06,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:06,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 02:43:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864840350] [2022-04-28 02:43:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-28 02:43:06,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:06,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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:43:06,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:06,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 02:43:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 02:43:06,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-04-28 02:43:06,706 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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:43:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:07,717 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 02:43:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 02:43:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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 29 [2022-04-28 02:43:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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:43:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 02:43:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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:43:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2022-04-28 02:43:07,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 42 transitions. [2022-04-28 02:43:07,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:07,766 INFO L225 Difference]: With dead ends: 42 [2022-04-28 02:43:07,766 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 02:43:07,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=1971, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 02:43:07,767 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:07,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:43:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 02:43:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 02:43:07,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:07,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:07,809 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:07,809 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:07,810 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 02:43:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 02:43:07,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:07,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:07,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:43:07,811 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 02:43:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:07,812 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 02:43:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 02:43:07,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:07,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:07,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:07,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-28 02:43:07,814 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2022-04-28 02:43:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:07,814 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-28 02:43:07,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 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:43:07,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-28 02:43:07,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 02:43:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 02:43:07,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:07,849 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:07,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 02:43:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:08,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:08,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2111093867, now seen corresponding path program 6 times [2022-04-28 02:43:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:08,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122504906] [2022-04-28 02:43:12,180 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:12,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:13,654 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:13,790 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:13,792 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:43:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632723, now seen corresponding path program 1 times [2022-04-28 02:43:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502060084] [2022-04-28 02:43:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:13,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {2052#(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); {2042#true} is VALID [2022-04-28 02:43:13,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {2042#true} assume true; {2042#true} is VALID [2022-04-28 02:43:13,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2042#true} {2042#true} #47#return; {2042#true} is VALID [2022-04-28 02:43:13,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {2042#true} call ULTIMATE.init(); {2052#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:13,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2052#(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); {2042#true} is VALID [2022-04-28 02:43:13,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {2042#true} assume true; {2042#true} is VALID [2022-04-28 02:43:13,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2042#true} {2042#true} #47#return; {2042#true} is VALID [2022-04-28 02:43:13,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {2042#true} call #t~ret3 := main(); {2042#true} is VALID [2022-04-28 02:43:13,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {2042#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:13,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse2 (= |v_main_#t~post2_80| |v_main_#t~post2_78|)) (.cse0 (<= 10 v_main_~i~0_118))) (or (and (or (not (<= v_main_~i~0_118 v_main_~n~0_33)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~n~0_33 v_main_~n~0_33)) (and (<= v_main_~i~0_117 (+ v_main_~n~0_33 1)) .cse0 (< v_main_~i~0_118 v_main_~i~0_117)))) InVars {main_~i~0=v_main_~i~0_118, main_#t~post2=|v_main_#t~post2_80|, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_117, main_#t~post2=|v_main_#t~post2_78|, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:13,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:13,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_120 v_main_~i~0_119)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_79|)) (.cse2 (= v_main_~sn~0_74 v_main_~sn~0_73))) (or (and (= v_main_~n~0_34 v_main_~n~0_34) .cse0 .cse1 .cse2) (and (< v_main_~i~0_119 11) (< v_main_~i~0_120 v_main_~i~0_119) (<= v_main_~i~0_119 (+ v_main_~n~0_34 1)) (= (+ (* 2 v_main_~i~0_120) v_main_~sn~0_73) (+ (* 2 v_main_~i~0_119) v_main_~sn~0_74))) (and .cse0 .cse1 (or (not (<= v_main_~i~0_120 v_main_~n~0_34)) (not (< v_main_~i~0_120 10))) .cse2))) InVars {main_~i~0=v_main_~i~0_120, main_#t~post2=|v_main_#t~post2_83|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_74} OutVars{main_~i~0=v_main_~i~0_119, main_#t~post2=|v_main_#t~post2_79|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_73} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2048#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:43:13,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2048#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2049#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:13,910 INFO L272 TraceCheckUtils]: 10: Hoare triple {2049#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2050#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:43:13,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {2050#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2051#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:43:13,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {2051#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2043#false} is VALID [2022-04-28 02:43:13,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#false} assume !false; {2043#false} is VALID [2022-04-28 02:43:13,914 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:43:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:13,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502060084] [2022-04-28 02:43:13,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502060084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:43:13,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177959682] [2022-04-28 02:43:13,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:13,915 INFO L229 MonitoredProcess]: Starting monitored process 7 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:43:13,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:43:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:13,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:43:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:13,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:43:14,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {2042#true} call ULTIMATE.init(); {2042#true} is VALID [2022-04-28 02:43:14,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2042#true} #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); {2042#true} is VALID [2022-04-28 02:43:14,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {2042#true} assume true; {2042#true} is VALID [2022-04-28 02:43:14,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2042#true} {2042#true} #47#return; {2042#true} is VALID [2022-04-28 02:43:14,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {2042#true} call #t~ret3 := main(); {2042#true} is VALID [2022-04-28 02:43:14,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {2042#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:14,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse2 (= |v_main_#t~post2_80| |v_main_#t~post2_78|)) (.cse0 (<= 10 v_main_~i~0_118))) (or (and (or (not (<= v_main_~i~0_118 v_main_~n~0_33)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~n~0_33 v_main_~n~0_33)) (and (<= v_main_~i~0_117 (+ v_main_~n~0_33 1)) .cse0 (< v_main_~i~0_118 v_main_~i~0_117)))) InVars {main_~i~0=v_main_~i~0_118, main_#t~post2=|v_main_#t~post2_80|, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_117, main_#t~post2=|v_main_#t~post2_78|, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:14,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:14,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {2047#(and (= main_~sn~0 0) (= main_~i~0 1))} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_120 v_main_~i~0_119)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_79|)) (.cse2 (= v_main_~sn~0_74 v_main_~sn~0_73))) (or (and (= v_main_~n~0_34 v_main_~n~0_34) .cse0 .cse1 .cse2) (and (< v_main_~i~0_119 11) (< v_main_~i~0_120 v_main_~i~0_119) (<= v_main_~i~0_119 (+ v_main_~n~0_34 1)) (= (+ (* 2 v_main_~i~0_120) v_main_~sn~0_73) (+ (* 2 v_main_~i~0_119) v_main_~sn~0_74))) (and .cse0 .cse1 (or (not (<= v_main_~i~0_120 v_main_~n~0_34)) (not (< v_main_~i~0_120 10))) .cse2))) InVars {main_~i~0=v_main_~i~0_120, main_#t~post2=|v_main_#t~post2_83|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_74} OutVars{main_~i~0=v_main_~i~0_119, main_#t~post2=|v_main_#t~post2_79|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_73} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2080#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:43:14,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2084#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:43:14,822 INFO L272 TraceCheckUtils]: 10: Hoare triple {2084#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:14,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {2088#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:14,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {2092#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2043#false} is VALID [2022-04-28 02:43:14,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#false} assume !false; {2043#false} is VALID [2022-04-28 02:43:14,823 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:43:14,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:43:16,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {2043#false} assume !false; {2043#false} is VALID [2022-04-28 02:43:16,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {2092#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2043#false} is VALID [2022-04-28 02:43:16,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {2088#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2092#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:16,065 INFO L272 TraceCheckUtils]: 10: Hoare triple {2049#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2088#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:16,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {2111#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2049#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:16,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {2115#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_120 v_main_~i~0_119)) (.cse1 (= |v_main_#t~post2_83| |v_main_#t~post2_79|)) (.cse2 (= v_main_~sn~0_74 v_main_~sn~0_73))) (or (and (= v_main_~n~0_34 v_main_~n~0_34) .cse0 .cse1 .cse2) (and (< v_main_~i~0_119 11) (< v_main_~i~0_120 v_main_~i~0_119) (<= v_main_~i~0_119 (+ v_main_~n~0_34 1)) (= (+ (* 2 v_main_~i~0_120) v_main_~sn~0_73) (+ (* 2 v_main_~i~0_119) v_main_~sn~0_74))) (and .cse0 .cse1 (or (not (<= v_main_~i~0_120 v_main_~n~0_34)) (not (< v_main_~i~0_120 10))) .cse2))) InVars {main_~i~0=v_main_~i~0_120, main_#t~post2=|v_main_#t~post2_83|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_74} OutVars{main_~i~0=v_main_~i~0_119, main_#t~post2=|v_main_#t~post2_79|, main_~n~0=v_main_~n~0_34, main_~sn~0=v_main_~sn~0_73} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2111#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:43:16,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2115#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:16,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {2122#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse2 (= |v_main_#t~post2_80| |v_main_#t~post2_78|)) (.cse0 (<= 10 v_main_~i~0_118))) (or (and (or (not (<= v_main_~i~0_118 v_main_~n~0_33)) (not .cse0)) .cse1 .cse2) (and .cse1 .cse2 (= v_main_~n~0_33 v_main_~n~0_33)) (and (<= v_main_~i~0_117 (+ v_main_~n~0_33 1)) .cse0 (< v_main_~i~0_118 v_main_~i~0_117)))) InVars {main_~i~0=v_main_~i~0_118, main_#t~post2=|v_main_#t~post2_80|, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_117, main_#t~post2=|v_main_#t~post2_78|, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2115#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:16,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {2042#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2122#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:43:16,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {2042#true} call #t~ret3 := main(); {2042#true} is VALID [2022-04-28 02:43:16,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2042#true} {2042#true} #47#return; {2042#true} is VALID [2022-04-28 02:43:16,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {2042#true} assume true; {2042#true} is VALID [2022-04-28 02:43:16,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {2042#true} #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); {2042#true} is VALID [2022-04-28 02:43:16,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {2042#true} call ULTIMATE.init(); {2042#true} is VALID [2022-04-28 02:43:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:43:16,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177959682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:43:16,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:43:16,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:43:16,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:16,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122504906] [2022-04-28 02:43:16,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122504906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:16,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:16,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 02:43:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16101852] [2022-04-28 02:43:16,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-28 02:43:16,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:16,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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:43:16,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:16,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 02:43:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:16,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 02:43:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 02:43:16,552 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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:43:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:17,749 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 02:43:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 02:43:17,749 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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 32 [2022-04-28 02:43:17,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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:43:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2022-04-28 02:43:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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:43:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2022-04-28 02:43:17,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 45 transitions. [2022-04-28 02:43:17,791 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-28 02:43:17,792 INFO L225 Difference]: With dead ends: 45 [2022-04-28 02:43:17,792 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 02:43:17,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=326, Invalid=2536, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 02:43:17,793 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:17,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 02:43:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 02:43:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 02:43:17,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:17,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:17,836 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:17,836 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:17,837 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 02:43:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 02:43:17,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:17,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:17,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 02:43:17,838 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 02:43:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:17,839 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 02:43:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 02:43:17,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:17,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:17,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:17,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 02:43:17,841 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2022-04-28 02:43:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:17,841 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 02:43:17,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 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:43:17,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 02:43:17,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 02:43:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 02:43:17,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:17,880 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:17,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 02:43:18,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:18,084 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -186245042, now seen corresponding path program 7 times [2022-04-28 02:43:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:18,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522948345] [2022-04-28 02:43:22,217 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:22,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:22,590 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:22,591 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:43:22,594 INFO L85 PathProgramCache]: Analyzing trace with hash -21100563, now seen corresponding path program 1 times [2022-04-28 02:43:22,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427128176] [2022-04-28 02:43:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:22,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {2450#(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); {2440#true} is VALID [2022-04-28 02:43:22,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {2440#true} assume true; {2440#true} is VALID [2022-04-28 02:43:22,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2440#true} {2440#true} #47#return; {2440#true} is VALID [2022-04-28 02:43:22,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:22,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {2450#(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); {2440#true} is VALID [2022-04-28 02:43:22,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {2440#true} assume true; {2440#true} is VALID [2022-04-28 02:43:22,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2440#true} {2440#true} #47#return; {2440#true} is VALID [2022-04-28 02:43:22,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {2440#true} call #t~ret3 := main(); {2440#true} is VALID [2022-04-28 02:43:22,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {2440#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:22,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_94| |v_main_#t~post2_92|)) (.cse1 (= v_main_~i~0_141 v_main_~i~0_140)) (.cse2 (<= 10 v_main_~i~0_141))) (or (and .cse0 .cse1 (= v_main_~n~0_38 v_main_~n~0_38)) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_141 v_main_~n~0_38))) .cse1) (and .cse2 (< v_main_~i~0_141 v_main_~i~0_140) (<= v_main_~i~0_140 (+ v_main_~n~0_38 1))))) InVars {main_~i~0=v_main_~i~0_141, main_#t~post2=|v_main_#t~post2_94|, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_140, main_#t~post2=|v_main_#t~post2_92|, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:22,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:22,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_97| |v_main_#t~post2_93|)) (.cse1 (= v_main_~i~0_143 v_main_~i~0_142)) (.cse2 (= v_main_~sn~0_89 v_main_~sn~0_88))) (or (and (= (+ (* 2 v_main_~i~0_142) v_main_~sn~0_89) (+ (* 2 v_main_~i~0_143) v_main_~sn~0_88)) (< v_main_~i~0_143 v_main_~i~0_142) (<= v_main_~i~0_142 (+ v_main_~n~0_39 1)) (< v_main_~i~0_142 11)) (and .cse0 .cse1 .cse2 (= v_main_~n~0_39 v_main_~n~0_39)) (and (or (not (<= v_main_~i~0_143 v_main_~n~0_39)) (not (< v_main_~i~0_143 10))) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_143, main_#t~post2=|v_main_#t~post2_97|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_89} OutVars{main_~i~0=v_main_~i~0_142, main_#t~post2=|v_main_#t~post2_93|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_88} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2446#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:22,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {2446#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2447#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:22,730 INFO L272 TraceCheckUtils]: 10: Hoare triple {2447#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:43:22,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2449#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:43:22,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {2449#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2441#false} is VALID [2022-04-28 02:43:22,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2022-04-28 02:43:22,731 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:43:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:22,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427128176] [2022-04-28 02:43:22,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427128176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:43:22,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169020859] [2022-04-28 02:43:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:22,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:22,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:22,736 INFO L229 MonitoredProcess]: Starting monitored process 8 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:43:22,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:43:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:22,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:43:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:22,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:43:23,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2022-04-28 02:43:23,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {2440#true} #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); {2440#true} is VALID [2022-04-28 02:43:23,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {2440#true} assume true; {2440#true} is VALID [2022-04-28 02:43:23,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2440#true} {2440#true} #47#return; {2440#true} is VALID [2022-04-28 02:43:23,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {2440#true} call #t~ret3 := main(); {2440#true} is VALID [2022-04-28 02:43:23,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2440#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:23,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_94| |v_main_#t~post2_92|)) (.cse1 (= v_main_~i~0_141 v_main_~i~0_140)) (.cse2 (<= 10 v_main_~i~0_141))) (or (and .cse0 .cse1 (= v_main_~n~0_38 v_main_~n~0_38)) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_141 v_main_~n~0_38))) .cse1) (and .cse2 (< v_main_~i~0_141 v_main_~i~0_140) (<= v_main_~i~0_140 (+ v_main_~n~0_38 1))))) InVars {main_~i~0=v_main_~i~0_141, main_#t~post2=|v_main_#t~post2_94|, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_140, main_#t~post2=|v_main_#t~post2_92|, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:23,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:23,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {2445#(and (= main_~sn~0 0) (= main_~i~0 1))} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_97| |v_main_#t~post2_93|)) (.cse1 (= v_main_~i~0_143 v_main_~i~0_142)) (.cse2 (= v_main_~sn~0_89 v_main_~sn~0_88))) (or (and (= (+ (* 2 v_main_~i~0_142) v_main_~sn~0_89) (+ (* 2 v_main_~i~0_143) v_main_~sn~0_88)) (< v_main_~i~0_143 v_main_~i~0_142) (<= v_main_~i~0_142 (+ v_main_~n~0_39 1)) (< v_main_~i~0_142 11)) (and .cse0 .cse1 .cse2 (= v_main_~n~0_39 v_main_~n~0_39)) (and (or (not (<= v_main_~i~0_143 v_main_~n~0_39)) (not (< v_main_~i~0_143 10))) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_143, main_#t~post2=|v_main_#t~post2_97|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_89} OutVars{main_~i~0=v_main_~i~0_142, main_#t~post2=|v_main_#t~post2_93|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_88} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2478#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:43:23,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {2478#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2482#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:43:23,719 INFO L272 TraceCheckUtils]: 10: Hoare triple {2482#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:23,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:23,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {2490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2441#false} is VALID [2022-04-28 02:43:23,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2022-04-28 02:43:23,720 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:43:23,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:43:24,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2022-04-28 02:43:24,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {2490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2441#false} is VALID [2022-04-28 02:43:24,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {2486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:24,818 INFO L272 TraceCheckUtils]: 10: Hoare triple {2447#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:24,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {2509#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2447#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:24,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {2513#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_97| |v_main_#t~post2_93|)) (.cse1 (= v_main_~i~0_143 v_main_~i~0_142)) (.cse2 (= v_main_~sn~0_89 v_main_~sn~0_88))) (or (and (= (+ (* 2 v_main_~i~0_142) v_main_~sn~0_89) (+ (* 2 v_main_~i~0_143) v_main_~sn~0_88)) (< v_main_~i~0_143 v_main_~i~0_142) (<= v_main_~i~0_142 (+ v_main_~n~0_39 1)) (< v_main_~i~0_142 11)) (and .cse0 .cse1 .cse2 (= v_main_~n~0_39 v_main_~n~0_39)) (and (or (not (<= v_main_~i~0_143 v_main_~n~0_39)) (not (< v_main_~i~0_143 10))) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_143, main_#t~post2=|v_main_#t~post2_97|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_89} OutVars{main_~i~0=v_main_~i~0_142, main_#t~post2=|v_main_#t~post2_93|, main_~n~0=v_main_~n~0_39, main_~sn~0=v_main_~sn~0_88} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2509#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)))} is VALID [2022-04-28 02:43:24,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {2513#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2513#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:43:24,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {2520#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_94| |v_main_#t~post2_92|)) (.cse1 (= v_main_~i~0_141 v_main_~i~0_140)) (.cse2 (<= 10 v_main_~i~0_141))) (or (and .cse0 .cse1 (= v_main_~n~0_38 v_main_~n~0_38)) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_141 v_main_~n~0_38))) .cse1) (and .cse2 (< v_main_~i~0_141 v_main_~i~0_140) (<= v_main_~i~0_140 (+ v_main_~n~0_38 1))))) InVars {main_~i~0=v_main_~i~0_141, main_#t~post2=|v_main_#t~post2_94|, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_140, main_#t~post2=|v_main_#t~post2_92|, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2513#(and (or (<= 10 main_~n~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (<= main_~i~0 main_~n~0) (and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) (+ main_~n~0 1)) (<= (+ main_~n~0 1) main_~i~0)))} is VALID [2022-04-28 02:43:24,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {2440#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2520#(and (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:43:24,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {2440#true} call #t~ret3 := main(); {2440#true} is VALID [2022-04-28 02:43:24,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2440#true} {2440#true} #47#return; {2440#true} is VALID [2022-04-28 02:43:24,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {2440#true} assume true; {2440#true} is VALID [2022-04-28 02:43:24,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {2440#true} #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); {2440#true} is VALID [2022-04-28 02:43:24,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2022-04-28 02:43:24,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:43:24,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169020859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:43:24,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:43:24,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:43:25,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:25,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522948345] [2022-04-28 02:43:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522948345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:25,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:25,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 02:43:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730729032] [2022-04-28 02:43:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-28 02:43:25,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:25,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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:43:25,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:25,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 02:43:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 02:43:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 02:43:25,386 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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:43:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:26,750 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-28 02:43:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 02:43:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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 35 [2022-04-28 02:43:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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:43:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-28 02:43:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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:43:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 48 transitions. [2022-04-28 02:43:26,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 48 transitions. [2022-04-28 02:43:26,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:26,801 INFO L225 Difference]: With dead ends: 48 [2022-04-28 02:43:26,801 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 02:43:26,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=367, Invalid=3173, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 02:43:26,802 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:26,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 02:43:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 02:43:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 02:43:26,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:26,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:26,856 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:26,856 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:26,859 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 02:43:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 02:43:26,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:26,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:26,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:43:26,860 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 02:43:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:26,861 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 02:43:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 02:43:26,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:26,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:26,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:26,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-28 02:43:26,863 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2022-04-28 02:43:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:26,863 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-28 02:43:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 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:43:26,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-28 02:43:26,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:26,913 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-28 02:43:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 02:43:26,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:26,913 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:26,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 02:43:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:27,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 94178699, now seen corresponding path program 8 times [2022-04-28 02:43:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:27,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954315483] [2022-04-28 02:43:31,230 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:31,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:31,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:31,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:43:31,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2028431597, now seen corresponding path program 1 times [2022-04-28 02:43:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:31,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122985328] [2022-04-28 02:43:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:31,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#(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); {2865#true} is VALID [2022-04-28 02:43:31,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {2865#true} assume true; {2865#true} is VALID [2022-04-28 02:43:31,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2865#true} {2865#true} #47#return; {2865#true} is VALID [2022-04-28 02:43:31,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {2865#true} call ULTIMATE.init(); {2875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:31,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#(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); {2865#true} is VALID [2022-04-28 02:43:31,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {2865#true} assume true; {2865#true} is VALID [2022-04-28 02:43:31,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2865#true} {2865#true} #47#return; {2865#true} is VALID [2022-04-28 02:43:31,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {2865#true} call #t~ret3 := main(); {2865#true} is VALID [2022-04-28 02:43:31,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {2865#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:31,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_165 v_main_~i~0_164)) (.cse2 (= |v_main_#t~post2_108| |v_main_#t~post2_106|)) (.cse1 (<= 10 v_main_~i~0_165))) (or (and .cse0 (or (not .cse1) (not (<= v_main_~i~0_165 v_main_~n~0_43))) .cse2) (and .cse0 .cse2 (= v_main_~n~0_43 v_main_~n~0_43)) (and .cse1 (<= v_main_~i~0_164 (+ v_main_~n~0_43 1)) (< v_main_~i~0_165 v_main_~i~0_164)))) InVars {main_~i~0=v_main_~i~0_165, main_#t~post2=|v_main_#t~post2_108|, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_164, main_#t~post2=|v_main_#t~post2_106|, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:31,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:31,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_111| |v_main_#t~post2_107|)) (.cse1 (= v_main_~sn~0_105 v_main_~sn~0_104)) (.cse2 (= v_main_~i~0_167 v_main_~i~0_166))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_167 v_main_~n~0_44)) (not (< v_main_~i~0_167 10))) .cse2) (and (<= v_main_~i~0_166 (+ v_main_~n~0_44 1)) (< v_main_~i~0_167 v_main_~i~0_166) (= (+ (* 2 v_main_~i~0_167) v_main_~sn~0_104) (+ v_main_~sn~0_105 (* 2 v_main_~i~0_166))) (< v_main_~i~0_166 11)) (and .cse0 (= v_main_~n~0_44 v_main_~n~0_44) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_167, main_#t~post2=|v_main_#t~post2_111|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_105} OutVars{main_~i~0=v_main_~i~0_166, main_#t~post2=|v_main_#t~post2_107|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_104} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2871#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:43:31,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2871#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2872#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:31,751 INFO L272 TraceCheckUtils]: 10: Hoare triple {2872#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:43:31,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {2873#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2874#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:43:31,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {2874#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2866#false} is VALID [2022-04-28 02:43:31,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {2866#false} assume !false; {2866#false} is VALID [2022-04-28 02:43:31,752 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:43:31,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122985328] [2022-04-28 02:43:31,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122985328] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:43:31,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736503820] [2022-04-28 02:43:31,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:31,757 INFO L229 MonitoredProcess]: Starting monitored process 9 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:43:31,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:43:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:31,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:43:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:31,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:43:32,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2865#true} call ULTIMATE.init(); {2865#true} is VALID [2022-04-28 02:43:32,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {2865#true} #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); {2865#true} is VALID [2022-04-28 02:43:32,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {2865#true} assume true; {2865#true} is VALID [2022-04-28 02:43:32,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2865#true} {2865#true} #47#return; {2865#true} is VALID [2022-04-28 02:43:32,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {2865#true} call #t~ret3 := main(); {2865#true} is VALID [2022-04-28 02:43:32,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {2865#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:32,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_165 v_main_~i~0_164)) (.cse2 (= |v_main_#t~post2_108| |v_main_#t~post2_106|)) (.cse1 (<= 10 v_main_~i~0_165))) (or (and .cse0 (or (not .cse1) (not (<= v_main_~i~0_165 v_main_~n~0_43))) .cse2) (and .cse0 .cse2 (= v_main_~n~0_43 v_main_~n~0_43)) (and .cse1 (<= v_main_~i~0_164 (+ v_main_~n~0_43 1)) (< v_main_~i~0_165 v_main_~i~0_164)))) InVars {main_~i~0=v_main_~i~0_165, main_#t~post2=|v_main_#t~post2_108|, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_164, main_#t~post2=|v_main_#t~post2_106|, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:32,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} is VALID [2022-04-28 02:43:32,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {2870#(and (= main_~sn~0 0) (= main_~i~0 1))} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_111| |v_main_#t~post2_107|)) (.cse1 (= v_main_~sn~0_105 v_main_~sn~0_104)) (.cse2 (= v_main_~i~0_167 v_main_~i~0_166))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_167 v_main_~n~0_44)) (not (< v_main_~i~0_167 10))) .cse2) (and (<= v_main_~i~0_166 (+ v_main_~n~0_44 1)) (< v_main_~i~0_167 v_main_~i~0_166) (= (+ (* 2 v_main_~i~0_167) v_main_~sn~0_104) (+ v_main_~sn~0_105 (* 2 v_main_~i~0_166))) (< v_main_~i~0_166 11)) (and .cse0 (= v_main_~n~0_44 v_main_~n~0_44) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_167, main_#t~post2=|v_main_#t~post2_111|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_105} OutVars{main_~i~0=v_main_~i~0_166, main_#t~post2=|v_main_#t~post2_107|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_104} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2903#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:43:32,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {2903#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2907#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:43:32,100 INFO L272 TraceCheckUtils]: 10: Hoare triple {2907#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:32,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {2911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:32,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2866#false} is VALID [2022-04-28 02:43:32,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {2866#false} assume !false; {2866#false} is VALID [2022-04-28 02:43:32,101 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:43:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:43:33,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {2866#false} assume !false; {2866#false} is VALID [2022-04-28 02:43:33,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2866#false} is VALID [2022-04-28 02:43:33,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {2911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:33,395 INFO L272 TraceCheckUtils]: 10: Hoare triple {2872#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:33,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {2934#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {2872#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:33,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {2938#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post2_111| |v_main_#t~post2_107|)) (.cse1 (= v_main_~sn~0_105 v_main_~sn~0_104)) (.cse2 (= v_main_~i~0_167 v_main_~i~0_166))) (or (and .cse0 .cse1 (or (not (<= v_main_~i~0_167 v_main_~n~0_44)) (not (< v_main_~i~0_167 10))) .cse2) (and (<= v_main_~i~0_166 (+ v_main_~n~0_44 1)) (< v_main_~i~0_167 v_main_~i~0_166) (= (+ (* 2 v_main_~i~0_167) v_main_~sn~0_104) (+ v_main_~sn~0_105 (* 2 v_main_~i~0_166))) (< v_main_~i~0_166 11)) (and .cse0 (= v_main_~n~0_44 v_main_~n~0_44) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_167, main_#t~post2=|v_main_#t~post2_111|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_105} OutVars{main_~i~0=v_main_~i~0_166, main_#t~post2=|v_main_#t~post2_107|, main_~n~0=v_main_~n~0_44, main_~sn~0=v_main_~sn~0_104} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {2934#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:43:33,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {2938#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2938#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:33,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2945#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_165 v_main_~i~0_164)) (.cse2 (= |v_main_#t~post2_108| |v_main_#t~post2_106|)) (.cse1 (<= 10 v_main_~i~0_165))) (or (and .cse0 (or (not .cse1) (not (<= v_main_~i~0_165 v_main_~n~0_43))) .cse2) (and .cse0 .cse2 (= v_main_~n~0_43 v_main_~n~0_43)) (and .cse1 (<= v_main_~i~0_164 (+ v_main_~n~0_43 1)) (< v_main_~i~0_165 v_main_~i~0_164)))) InVars {main_~i~0=v_main_~i~0_165, main_#t~post2=|v_main_#t~post2_108|, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_164, main_#t~post2=|v_main_#t~post2_106|, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {2938#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:33,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {2865#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {2945#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:43:33,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {2865#true} call #t~ret3 := main(); {2865#true} is VALID [2022-04-28 02:43:33,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2865#true} {2865#true} #47#return; {2865#true} is VALID [2022-04-28 02:43:33,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {2865#true} assume true; {2865#true} is VALID [2022-04-28 02:43:33,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {2865#true} #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); {2865#true} is VALID [2022-04-28 02:43:33,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {2865#true} call ULTIMATE.init(); {2865#true} is VALID [2022-04-28 02:43:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:43:33,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736503820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:43:33,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:43:33,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:43:34,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:34,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954315483] [2022-04-28 02:43:34,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954315483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:34,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:34,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 02:43:34,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053440599] [2022-04-28 02:43:34,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-28 02:43:34,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:34,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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:43:34,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:34,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 02:43:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 02:43:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 02:43:34,063 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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:43:35,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:35,584 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 02:43:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 02:43:35,584 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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 38 [2022-04-28 02:43:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:43:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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:43:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2022-04-28 02:43:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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:43:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2022-04-28 02:43:35,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 51 transitions. [2022-04-28 02:43:35,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:43:35,630 INFO L225 Difference]: With dead ends: 51 [2022-04-28 02:43:35,630 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 02:43:35,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=3882, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 02:43:35,632 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 02:43:35,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 119 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 02:43:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 02:43:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 02:43:35,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:43:35,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:35,681 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:35,681 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:35,682 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-28 02:43:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 02:43:35,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:35,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:35,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 02:43:35,683 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 02:43:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:43:35,684 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-28 02:43:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 02:43:35,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:43:35,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:43:35,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:43:35,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:43:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:43:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-28 02:43:35,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2022-04-28 02:43:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:43:35,686 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-28 02:43:35,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 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:43:35,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-28 02:43:35,744 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-28 02:43:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-28 02:43:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 02:43:35,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:43:35,745 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:43:35,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 02:43:35,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 02:43:35,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:43:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:43:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash 486456110, now seen corresponding path program 9 times [2022-04-28 02:43:35,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:43:35,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [852175033] [2022-04-28 02:43:36,244 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:39,724 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:43:39,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:43:39,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:43:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -217003539, now seen corresponding path program 1 times [2022-04-28 02:43:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:43:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041481016] [2022-04-28 02:43:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:43:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:43:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:39,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#(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); {3317#true} is VALID [2022-04-28 02:43:39,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 02:43:39,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3317#true} {3317#true} #47#return; {3317#true} is VALID [2022-04-28 02:43:39,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:43:39,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {3327#(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); {3317#true} is VALID [2022-04-28 02:43:39,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 02:43:39,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #47#return; {3317#true} is VALID [2022-04-28 02:43:39,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret3 := main(); {3317#true} is VALID [2022-04-28 02:43:39,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:39,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [85] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 10 v_main_~i~0_190)) (.cse1 (= |v_main_#t~post2_122| |v_main_#t~post2_120|))) (or (and (< v_main_~i~0_190 v_main_~i~0_189) .cse0 (<= v_main_~i~0_189 (+ v_main_~n~0_48 1))) (and (or (not .cse0) (not (<= v_main_~i~0_190 v_main_~n~0_48))) .cse1 (= v_main_~i~0_189 v_main_~i~0_190)) (and .cse1 (= v_main_~i~0_190 v_main_~i~0_189) (= v_main_~n~0_48 v_main_~n~0_48)))) InVars {main_~i~0=v_main_~i~0_190, main_#t~post2=|v_main_#t~post2_122|, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_189, main_#t~post2=|v_main_#t~post2_120|, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:39,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [86] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:39,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [87] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_192 v_main_~i~0_191)) (.cse1 (= |v_main_#t~post2_125| |v_main_#t~post2_121|))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_192 10)) (not (<= v_main_~i~0_192 v_main_~n~0_49))) (= v_main_~sn~0_121 v_main_~sn~0_122)) (and (= (+ (* 2 v_main_~i~0_192) v_main_~sn~0_121) (+ (* 2 v_main_~i~0_191) v_main_~sn~0_122)) (< v_main_~i~0_191 11) (< v_main_~i~0_192 v_main_~i~0_191) (<= v_main_~i~0_191 (+ v_main_~n~0_49 1))) (and .cse0 .cse1 (= v_main_~sn~0_122 v_main_~sn~0_121) (= v_main_~n~0_49 v_main_~n~0_49)))) InVars {main_~i~0=v_main_~i~0_192, main_#t~post2=|v_main_#t~post2_125|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_122} OutVars{main_~i~0=v_main_~i~0_191, main_#t~post2=|v_main_#t~post2_121|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_121} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {3323#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} is VALID [2022-04-28 02:43:39,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {3323#(or (= main_~sn~0 0) (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0))))} [84] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {3324#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:39,973 INFO L272 TraceCheckUtils]: 10: Hoare triple {3324#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3325#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:43:39,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {3325#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3326#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:43:39,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {3326#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 02:43:39,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 02:43:39,974 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:43:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:43:39,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041481016] [2022-04-28 02:43:39,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041481016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:43:39,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452110051] [2022-04-28 02:43:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:43:39,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:43:39,976 INFO L229 MonitoredProcess]: Starting monitored process 10 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:43:39,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 02:43:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:40,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 02:43:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:43:40,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:43:41,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-28 02:43:41,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} #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); {3317#true} is VALID [2022-04-28 02:43:41,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 02:43:41,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #47#return; {3317#true} is VALID [2022-04-28 02:43:41,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret3 := main(); {3317#true} is VALID [2022-04-28 02:43:41,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:41,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [85] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 10 v_main_~i~0_190)) (.cse1 (= |v_main_#t~post2_122| |v_main_#t~post2_120|))) (or (and (< v_main_~i~0_190 v_main_~i~0_189) .cse0 (<= v_main_~i~0_189 (+ v_main_~n~0_48 1))) (and (or (not .cse0) (not (<= v_main_~i~0_190 v_main_~n~0_48))) .cse1 (= v_main_~i~0_189 v_main_~i~0_190)) (and .cse1 (= v_main_~i~0_190 v_main_~i~0_189) (= v_main_~n~0_48 v_main_~n~0_48)))) InVars {main_~i~0=v_main_~i~0_190, main_#t~post2=|v_main_#t~post2_122|, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_189, main_#t~post2=|v_main_#t~post2_120|, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:41,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [86] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-28 02:43:41,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {3322#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [87] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_192 v_main_~i~0_191)) (.cse1 (= |v_main_#t~post2_125| |v_main_#t~post2_121|))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_192 10)) (not (<= v_main_~i~0_192 v_main_~n~0_49))) (= v_main_~sn~0_121 v_main_~sn~0_122)) (and (= (+ (* 2 v_main_~i~0_192) v_main_~sn~0_121) (+ (* 2 v_main_~i~0_191) v_main_~sn~0_122)) (< v_main_~i~0_191 11) (< v_main_~i~0_192 v_main_~i~0_191) (<= v_main_~i~0_191 (+ v_main_~n~0_49 1))) (and .cse0 .cse1 (= v_main_~sn~0_122 v_main_~sn~0_121) (= v_main_~n~0_49 v_main_~n~0_49)))) InVars {main_~i~0=v_main_~i~0_192, main_#t~post2=|v_main_#t~post2_125|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_122} OutVars{main_~i~0=v_main_~i~0_191, main_#t~post2=|v_main_#t~post2_121|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_121} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {3355#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} is VALID [2022-04-28 02:43:41,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {3355#(or (and (= main_~sn~0 0) (= main_~i~0 1)) (and (<= main_~i~0 (+ main_~n~0 1)) (< 1 main_~i~0) (< main_~i~0 11) (= (+ 2 main_~sn~0) (* main_~i~0 2))))} [84] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {3359#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} is VALID [2022-04-28 02:43:41,045 INFO L272 TraceCheckUtils]: 10: Hoare triple {3359#(or (and (= main_~sn~0 0) (not (<= 1 main_~n~0))) (and (< (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) 11) (= (mod main_~sn~0 2) 0) (< 1 (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2))) (not (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~n~0)) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~n~0 1))))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:41,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:41,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 02:43:41,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 02:43:41,046 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:43:41,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:43:42,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-28 02:43:42,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {3367#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3318#false} is VALID [2022-04-28 02:43:42,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3367#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:43:42,020 INFO L272 TraceCheckUtils]: 10: Hoare triple {3324#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3363#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:43:42,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {3386#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} [84] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {3324#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0))} is VALID [2022-04-28 02:43:42,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {3390#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [87] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_192 v_main_~i~0_191)) (.cse1 (= |v_main_#t~post2_125| |v_main_#t~post2_121|))) (or (and .cse0 .cse1 (or (not (< v_main_~i~0_192 10)) (not (<= v_main_~i~0_192 v_main_~n~0_49))) (= v_main_~sn~0_121 v_main_~sn~0_122)) (and (= (+ (* 2 v_main_~i~0_192) v_main_~sn~0_121) (+ (* 2 v_main_~i~0_191) v_main_~sn~0_122)) (< v_main_~i~0_191 11) (< v_main_~i~0_192 v_main_~i~0_191) (<= v_main_~i~0_191 (+ v_main_~n~0_49 1))) (and .cse0 .cse1 (= v_main_~sn~0_122 v_main_~sn~0_121) (= v_main_~n~0_49 v_main_~n~0_49)))) InVars {main_~i~0=v_main_~i~0_192, main_#t~post2=|v_main_#t~post2_125|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_122} OutVars{main_~i~0=v_main_~i~0_191, main_#t~post2=|v_main_#t~post2_121|, main_~n~0=v_main_~n~0_49, main_~sn~0=v_main_~sn~0_121} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {3386#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0))} is VALID [2022-04-28 02:43:42,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {3390#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} [86] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3390#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:42,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {3397#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} [85] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 10 v_main_~i~0_190)) (.cse1 (= |v_main_#t~post2_122| |v_main_#t~post2_120|))) (or (and (< v_main_~i~0_190 v_main_~i~0_189) .cse0 (<= v_main_~i~0_189 (+ v_main_~n~0_48 1))) (and (or (not .cse0) (not (<= v_main_~i~0_190 v_main_~n~0_48))) .cse1 (= v_main_~i~0_189 v_main_~i~0_190)) (and .cse1 (= v_main_~i~0_190 v_main_~i~0_189) (= v_main_~n~0_48 v_main_~n~0_48)))) InVars {main_~i~0=v_main_~i~0_190, main_#t~post2=|v_main_#t~post2_122|, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_189, main_#t~post2=|v_main_#t~post2_120|, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {3390#(and (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (<= 10 main_~n~0) (<= (+ main_~n~0 1) main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= 10 main_~n~0) (<= (+ main_~n~0 1) (+ main_~i~0 (div (* (- 1) main_~sn~0) 2)))) (or (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (<= (+ main_~n~0 1) main_~i~0) (<= (+ main_~i~0 (div (+ (- 1) (* (- 1) main_~sn~0)) 2)) main_~n~0)) (or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0) (<= main_~i~0 main_~n~0)))} is VALID [2022-04-28 02:43:42,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {3397#(and (= main_~sn~0 0) (< 0 (+ main_~i~0 (div (* (- 1) main_~sn~0) 2))) (or (<= 10 main_~i~0) (<= (+ (div main_~sn~0 (- 2)) main_~i~0) 1)))} is VALID [2022-04-28 02:43:42,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret3 := main(); {3317#true} is VALID [2022-04-28 02:43:42,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #47#return; {3317#true} is VALID [2022-04-28 02:43:42,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-28 02:43:42,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} #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); {3317#true} is VALID [2022-04-28 02:43:42,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-28 02:43:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:43:42,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452110051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:43:42,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:43:42,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2022-04-28 02:43:42,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:43:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [852175033] [2022-04-28 02:43:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [852175033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:43:42,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:43:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 02:43:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985187098] [2022-04-28 02:43:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:43:42,784 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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 41 [2022-04-28 02:43:42,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:43:42,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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:43:42,798 WARN L143 InductivityCheck]: Transition 3444#(and (<= main_~i~0 (+ main_~n~0 1)) (= (+ (- 1) main_~i~0) 10) (= main_~sn~0 18)) ( _ , assume !(~i~0 <= ~n~0); , 3324#(or (and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0)) (= main_~sn~0 0)) ) not inductive [2022-04-28 02:43:42,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 02:43:42,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:43:43,000 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:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 02:43:43,003 INFO L158 Benchmark]: Toolchain (without parser) took 83337.20ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 126.2MB in the beginning and 150.4MB in the end (delta: -24.2MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-28 02:43:43,003 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 90.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:43:43,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 176.2MB. Free memory was 125.9MB in the beginning and 151.6MB in the end (delta: -25.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:43:43,004 INFO L158 Benchmark]: Boogie Preprocessor took 24.53ms. Allocated memory is still 176.2MB. Free memory was 151.6MB in the beginning and 149.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 02:43:43,004 INFO L158 Benchmark]: RCFGBuilder took 264.43ms. Allocated memory is still 176.2MB. Free memory was 149.9MB in the beginning and 139.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:43:43,004 INFO L158 Benchmark]: TraceAbstraction took 82798.75ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 139.0MB in the beginning and 150.4MB in the end (delta: -11.4MB). Peak memory consumption was 25.1MB. Max. memory is 8.0GB. [2022-04-28 02:43:43,005 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 142.6MB in the beginning and 142.5MB in the end (delta: 90.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.29ms. Allocated memory is still 176.2MB. Free memory was 125.9MB in the beginning and 151.6MB in the end (delta: -25.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.53ms. Allocated memory is still 176.2MB. Free memory was 151.6MB in the beginning and 149.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 264.43ms. Allocated memory is still 176.2MB. Free memory was 149.9MB in the beginning and 139.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 82798.75ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 139.0MB in the beginning and 150.4MB in the end (delta: -11.4MB). Peak memory consumption was 25.1MB. 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-28 02:43:43,029 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...