/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:00:34,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:00:34,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:00:34,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:00:34,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:00:34,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:00:34,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:00:34,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:00:34,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:00:34,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:00:34,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:00:34,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:00:34,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:00:34,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:00:34,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:00:34,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:00:34,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:00:34,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:00:34,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:00:34,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:00:34,138 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:00:34,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:00:34,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:00:34,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:00:34,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:00:34,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:00:34,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:00:34,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:00:34,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:00:34,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:00:34,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:00:34,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:00:34,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:00:34,146 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:00:34,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:00:34,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:00:34,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:00:34,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:00:34,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:00:34,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:00:34,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:00:34,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:00:34,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:00:34,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:00:34,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:00:34,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:00:34,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:00:34,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:00:34,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:00:34,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:00:34,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:00:34,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:34,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:00:34,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:00:34,161 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:00:34,161 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:00:34,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:00:34,161 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:00:34,161 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-08 09:00:34,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:00:34,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:00:34,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:00:34,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:00:34,397 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:00:34,398 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-08 09:00:34,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b666f2596/d724644ba8194384b28e5a3d6e479f4c/FLAG27bb595a1 [2022-04-08 09:00:34,870 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:00:34,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-08 09:00:34,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b666f2596/d724644ba8194384b28e5a3d6e479f4c/FLAG27bb595a1 [2022-04-08 09:00:34,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b666f2596/d724644ba8194384b28e5a3d6e479f4c [2022-04-08 09:00:34,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:00:34,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:00:34,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:34,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:00:34,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:00:34,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:34" (1/1) ... [2022-04-08 09:00:34,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@312210d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:34, skipping insertion in model container [2022-04-08 09:00:34,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:00:34" (1/1) ... [2022-04-08 09:00:34,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:00:34,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:00:35,099 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-08 09:00:35,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:35,125 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:00:35,133 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-08 09:00:35,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:00:35,147 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:00:35,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35 WrapperNode [2022-04-08 09:00:35,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:00:35,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:00:35,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:00:35,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:00:35,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:00:35,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:00:35,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:00:35,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:00:35,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (1/1) ... [2022-04-08 09:00:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:00:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:35,225 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-08 09:00:35,237 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-08 09:00:35,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:00:35,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:00:35,264 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:00:35,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:00:35,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:00:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:00:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:00:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:00:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:00:35,265 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:00:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:00:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:00:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 09:00:35,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:00:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:00:35,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:00:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:00:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:00:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:00:35,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:00:35,318 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:00:35,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:00:35,511 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:00:35,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:00:35,516 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:00:35,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:35 BoogieIcfgContainer [2022-04-08 09:00:35,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:00:35,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:00:35,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:00:35,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:00:35,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:00:34" (1/3) ... [2022-04-08 09:00:35,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5715fd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:35, skipping insertion in model container [2022-04-08 09:00:35,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:00:35" (2/3) ... [2022-04-08 09:00:35,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5715fd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:00:35, skipping insertion in model container [2022-04-08 09:00:35,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:00:35" (3/3) ... [2022-04-08 09:00:35,522 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2022-04-08 09:00:35,525 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:00:35,525 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:00:35,585 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:00:35,589 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:00:35,589 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:00:35,619 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-08 09:00:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:00:35,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:35,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:35,624 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-08 09:00:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:35,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1803277974] [2022-04-08 09:00:35,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:00:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-08 09:00:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:35,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69104203] [2022-04-08 09:00:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:35,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:35,823 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-08 09:00:35,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:00:35,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:00:35,828 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-08 09:00:35,829 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-08 09:00:35,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-08 09:00:35,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-08 09:00:35,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-08 09:00:35,830 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-08 09:00:35,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-08 09:00:35,831 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-08 09:00:35,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-08 09:00:35,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-08 09:00:35,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-08 09:00:35,832 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-08 09:00:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:35,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69104203] [2022-04-08 09:00:35,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69104203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:35,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:35,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:00:35,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:35,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1803277974] [2022-04-08 09:00:35,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1803277974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:35,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:35,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:00:35,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157322431] [2022-04-08 09:00:35,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:35,840 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-08 09:00:35,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:35,842 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-08 09:00:35,858 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-08 09:00:35,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:00:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:00:35,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:00:35,880 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-08 09:00:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:35,951 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-08 09:00:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:00:35,951 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-08 09:00:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:35,952 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-08 09:00:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:00:35,960 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-08 09:00:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-08 09:00:35,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-08 09:00:36,007 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-08 09:00:36,013 INFO L225 Difference]: With dead ends: 31 [2022-04-08 09:00:36,013 INFO L226 Difference]: Without dead ends: 14 [2022-04-08 09:00:36,016 INFO L912 BasicCegarLoop]: 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-08 09:00:36,021 INFO L913 BasicCegarLoop]: 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-08 09:00:36,022 INFO L914 BasicCegarLoop]: 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-08 09:00:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-08 09:00:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-08 09:00:36,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:36,046 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-08 09:00:36,046 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-08 09:00:36,046 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-08 09:00:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:36,052 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:00:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:00:36,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:36,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:36,053 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-08 09:00:36,053 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-08 09:00:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:36,058 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-08 09:00:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:00:36,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:36,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:36,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:36,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:36,064 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-08 09:00:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 09:00:36,066 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 09:00:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:36,066 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 09:00:36,066 INFO L479 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-08 09:00:36,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 09:00:36,105 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-08 09:00:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 09:00:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:00:36,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:36,108 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:36,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:00:36,113 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:36,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-08 09:00:36,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:36,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590033675] [2022-04-08 09:00:36,116 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:00:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-08 09:00:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:36,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772362763] [2022-04-08 09:00:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:36,240 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-08 09:00:36,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:00:36,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:00:36,242 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-08 09:00:36,242 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-08 09:00:36,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-08 09:00:36,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-08 09:00:36,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-08 09:00:36,244 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-08 09:00:36,244 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-08 09:00:36,245 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-08 09:00:36,246 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-08 09:00:36,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-08 09:00:36,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-08 09:00:36,246 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-08 09:00:36,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:36,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772362763] [2022-04-08 09:00:36,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772362763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:36,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:36,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:36,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:36,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590033675] [2022-04-08 09:00:36,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590033675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:36,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:36,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433662466] [2022-04-08 09:00:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:36,249 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-08 09:00:36,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:36,249 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-08 09:00:36,260 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-08 09:00:36,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:00:36,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:36,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:00:36,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:00:36,262 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-08 09:00:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:36,379 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-08 09:00:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:00:36,379 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-08 09:00:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:36,380 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-08 09:00:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:00:36,385 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-08 09:00:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-08 09:00:36,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-08 09:00:36,408 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-08 09:00:36,409 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:00:36,409 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:00:36,409 INFO L912 BasicCegarLoop]: 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-08 09:00:36,410 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:36,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:00:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:00:36,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:36,414 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-08 09:00:36,414 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-08 09:00:36,415 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-08 09:00:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:36,416 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:00:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:00:36,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:36,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:36,416 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-08 09:00:36,417 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-08 09:00:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:36,417 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:00:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:00:36,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:36,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:36,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:36,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:36,418 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-08 09:00:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 09:00:36,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 09:00:36,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:36,419 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 09:00:36,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:00:36,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 09:00:36,435 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-08 09:00:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:00:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:00:36,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:36,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:36,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:00:36,436 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-08 09:00:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142869861] [2022-04-08 09:00:36,460 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:36,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 2 times [2022-04-08 09:00:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:36,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790560950] [2022-04-08 09:00:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:36,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#(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-08 09:00:36,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-08 09:00:36,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-08 09:00:36,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:36,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#(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-08 09:00:36,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-08 09:00:36,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-08 09:00:36,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2022-04-08 09:00:36,613 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-08 09:00:36,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {284#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:36,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {285#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-08 09:00:36,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {286#(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-08 09:00:36,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(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)))} assume !(~i~0 <= ~n~0); {287#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:36,617 INFO L272 TraceCheckUtils]: 10: Hoare triple {287#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {288#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:36,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {289#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:36,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {279#false} is VALID [2022-04-08 09:00:36,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-04-08 09:00:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:36,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790560950] [2022-04-08 09:00:36,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790560950] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:36,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988327519] [2022-04-08 09:00:36,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:36,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:36,620 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-08 09:00:36,670 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-08 09:00:36,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:36,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:36,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 09:00:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:36,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:37,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2022-04-08 09:00:37,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#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); {278#true} is VALID [2022-04-08 09:00:37,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-08 09:00:37,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-08 09:00:37,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2022-04-08 09:00:37,049 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-08 09:00:37,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {284#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:37,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {315#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:37,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {319#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:37,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} assume !(~i~0 <= ~n~0); {323#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-08 09:00:37,053 INFO L272 TraceCheckUtils]: 10: Hoare triple {323#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:37,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:37,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {279#false} is VALID [2022-04-08 09:00:37,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-04-08 09:00:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:37,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:37,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-04-08 09:00:37,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {279#false} is VALID [2022-04-08 09:00:37,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:37,353 INFO L272 TraceCheckUtils]: 10: Hoare triple {347#(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)); {327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:37,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {347#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:37,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {351#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:37,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {355#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:37,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {359#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:37,358 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; {363#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:37,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2022-04-08 09:00:37,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-08 09:00:37,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-08 09:00:37,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#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); {278#true} is VALID [2022-04-08 09:00:37,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2022-04-08 09:00:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:37,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988327519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:37,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:37,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-08 09:00:37,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:37,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142869861] [2022-04-08 09:00:37,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142869861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:37,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:37,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:00:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550305904] [2022-04-08 09:00:37,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:37,360 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-08 09:00:37,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:37,361 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-08 09:00:37,373 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-08 09:00:37,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:00:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:00:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:00:37,374 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-08 09:00:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:37,603 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-08 09:00:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:00:37,603 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-08 09:00:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:37,604 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-08 09:00:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-08 09:00:37,605 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-08 09:00:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-08 09:00:37,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-08 09:00:37,636 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-08 09:00:37,637 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:00:37,637 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 09:00:37,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-04-08 09:00:37,638 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:37,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 09:00:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-08 09:00:37,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:37,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-08 09:00:37,649 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-08 09:00:37,649 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-08 09:00:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:37,650 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-08 09:00:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 09:00:37,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:37,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:37,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 20 states. [2022-04-08 09:00:37,651 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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 20 states. [2022-04-08 09:00:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:37,652 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-08 09:00:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-08 09:00:37,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:37,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:37,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:37,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-08 09:00:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-08 09:00:37,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-08 09:00:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:37,653 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-08 09:00:37,653 INFO L479 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-08 09:00:37,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-08 09:00:37,670 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-08 09:00:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-08 09:00:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:00:37,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:37,670 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:37,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 09:00:37,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:37,884 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 473295148, now seen corresponding path program 3 times [2022-04-08 09:00:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:37,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505418140] [2022-04-08 09:00:37,894 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:37,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 473295148, now seen corresponding path program 4 times [2022-04-08 09:00:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:37,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73141803] [2022-04-08 09:00:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:38,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(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); {542#true} is VALID [2022-04-08 09:00:38,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:00:38,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #47#return; {542#true} is VALID [2022-04-08 09:00:38,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:38,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(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); {542#true} is VALID [2022-04-08 09:00:38,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:00:38,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #47#return; {542#true} is VALID [2022-04-08 09:00:38,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret3 := main(); {542#true} is VALID [2022-04-08 09:00:38,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#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; {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:38,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:38,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {548#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:38,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {549#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:38,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0); {550#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} is VALID [2022-04-08 09:00:38,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {551#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:38,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {552#(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-08 09:00:38,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {552#(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)))} assume !(~i~0 <= ~n~0); {553#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:38,068 INFO L272 TraceCheckUtils]: 13: Hoare triple {553#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {554#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:38,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {555#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:38,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {543#false} is VALID [2022-04-08 09:00:38,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 09:00:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:38,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:38,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73141803] [2022-04-08 09:00:38,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73141803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:38,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060545755] [2022-04-08 09:00:38,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:38,084 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-08 09:00:38,085 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-08 09:00:38,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:38,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:38,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 09:00:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:38,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:38,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2022-04-08 09:00:38,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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); {542#true} is VALID [2022-04-08 09:00:38,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:00:38,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #47#return; {542#true} is VALID [2022-04-08 09:00:38,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret3 := main(); {542#true} is VALID [2022-04-08 09:00:38,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#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; {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:38,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:38,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {548#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:38,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {584#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:38,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#(and (= (+ (- 2) main_~i~0) 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {588#(and (= (+ (- 2) main_~i~0) 0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:38,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {588#(and (= (+ (- 2) main_~i~0) 0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {592#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} is VALID [2022-04-08 09:00:38,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(and (= (+ (- 2) main_~i~0) 0) (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {596#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} is VALID [2022-04-08 09:00:38,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(and (<= 4 main_~sn~0) (<= 2 main_~n~0) (<= main_~sn~0 4) (<= main_~i~0 3))} assume !(~i~0 <= ~n~0); {600#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} is VALID [2022-04-08 09:00:38,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {600#(and (<= 4 main_~sn~0) (< main_~n~0 3) (<= 2 main_~n~0) (<= main_~sn~0 4))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:38,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:38,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {543#false} is VALID [2022-04-08 09:00:38,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 09:00:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:38,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:38,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 09:00:38,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {608#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {543#false} is VALID [2022-04-08 09:00:38,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {608#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:38,904 INFO L272 TraceCheckUtils]: 13: Hoare triple {624#(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)); {604#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:38,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {624#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:38,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {632#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {628#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:38,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {636#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {632#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:38,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {640#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {636#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:38,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {644#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {640#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:38,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {648#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {644#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:38,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {648#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0); {648#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:38,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#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; {648#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:38,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret3 := main(); {542#true} is VALID [2022-04-08 09:00:38,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #47#return; {542#true} is VALID [2022-04-08 09:00:38,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:00:38,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#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); {542#true} is VALID [2022-04-08 09:00:38,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2022-04-08 09:00:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:38,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060545755] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:38,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-08 09:00:38,916 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:38,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505418140] [2022-04-08 09:00:38,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505418140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:38,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:38,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:00:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472965287] [2022-04-08 09:00:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:38,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:38,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:38,930 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-08 09:00:38,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:00:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:38,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:00:38,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-04-08 09:00:38,931 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:39,311 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:00:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 09:00:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-08 09:00:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 32 transitions. [2022-04-08 09:00:39,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 32 transitions. [2022-04-08 09:00:39,341 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-08 09:00:39,343 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:00:39,343 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:00:39,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=1067, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 09:00:39,344 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:39,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 46 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:00:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-08 09:00:39,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:39,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 09:00:39,368 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 09:00:39,368 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 09:00:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:39,369 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 09:00:39,369 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 09:00:39,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:39,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:39,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 24 states. [2022-04-08 09:00:39,370 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 24 states. [2022-04-08 09:00:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:39,371 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 09:00:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 09:00:39,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:39,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:39,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:39,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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-08 09:00:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-08 09:00:39,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-08 09:00:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:39,372 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-08 09:00:39,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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-08 09:00:39,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-08 09:00:39,393 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-08 09:00:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-08 09:00:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:00:39,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:39,394 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:39,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:39,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-08 09:00:39,603 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2046664786, now seen corresponding path program 1 times [2022-04-08 09:00:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:39,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273845101] [2022-04-08 09:00:39,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:39,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2046664786, now seen corresponding path program 2 times [2022-04-08 09:00:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:39,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617156372] [2022-04-08 09:00:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:39,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:39,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {847#(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); {840#true} is VALID [2022-04-08 09:00:39,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 09:00:39,667 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {840#true} {840#true} #47#return; {840#true} is VALID [2022-04-08 09:00:39,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:39,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {847#(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); {840#true} is VALID [2022-04-08 09:00:39,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 09:00:39,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #47#return; {840#true} is VALID [2022-04-08 09:00:39,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret3 := main(); {840#true} is VALID [2022-04-08 09:00:39,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#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; {845#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:39,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {845#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:39,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {845#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:39,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {846#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:39,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {846#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:39,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#(<= main_~i~0 2)} assume !(~i~0 < 10); {841#false} is VALID [2022-04-08 09:00:39,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {841#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {841#false} is VALID [2022-04-08 09:00:39,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {841#false} assume !(~i~0 <= ~n~0); {841#false} is VALID [2022-04-08 09:00:39,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {841#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {841#false} is VALID [2022-04-08 09:00:39,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-08 09:00:39,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-08 09:00:39,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 09:00:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:39,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617156372] [2022-04-08 09:00:39,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617156372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:39,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784843963] [2022-04-08 09:00:39,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:39,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:39,674 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-08 09:00:39,675 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-08 09:00:39,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:39,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:39,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 09:00:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:39,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:39,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 09:00:39,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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); {840#true} is VALID [2022-04-08 09:00:39,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 09:00:39,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #47#return; {840#true} is VALID [2022-04-08 09:00:39,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret3 := main(); {840#true} is VALID [2022-04-08 09:00:39,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#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; {866#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:39,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {866#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {866#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:39,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {866#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:39,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {846#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:39,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {846#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:39,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {846#(<= main_~i~0 2)} assume !(~i~0 < 10); {841#false} is VALID [2022-04-08 09:00:39,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {841#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {841#false} is VALID [2022-04-08 09:00:39,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {841#false} assume !(~i~0 <= ~n~0); {841#false} is VALID [2022-04-08 09:00:39,786 INFO L272 TraceCheckUtils]: 13: Hoare triple {841#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {841#false} is VALID [2022-04-08 09:00:39,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-08 09:00:39,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-08 09:00:39,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 09:00:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:39,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:39,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 09:00:39,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-08 09:00:39,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-08 09:00:39,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {841#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {841#false} is VALID [2022-04-08 09:00:39,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {841#false} assume !(~i~0 <= ~n~0); {841#false} is VALID [2022-04-08 09:00:39,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {841#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {841#false} is VALID [2022-04-08 09:00:39,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {918#(< main_~i~0 10)} assume !(~i~0 < 10); {841#false} is VALID [2022-04-08 09:00:39,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {918#(< main_~i~0 10)} is VALID [2022-04-08 09:00:39,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {925#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {918#(< main_~i~0 10)} is VALID [2022-04-08 09:00:39,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {925#(< main_~i~0 9)} is VALID [2022-04-08 09:00:39,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {925#(< main_~i~0 9)} is VALID [2022-04-08 09:00:39,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#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; {925#(< main_~i~0 9)} is VALID [2022-04-08 09:00:39,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret3 := main(); {840#true} is VALID [2022-04-08 09:00:39,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #47#return; {840#true} is VALID [2022-04-08 09:00:39,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 09:00:39,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#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); {840#true} is VALID [2022-04-08 09:00:39,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 09:00:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:39,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784843963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:39,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:39,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 09:00:39,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:39,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273845101] [2022-04-08 09:00:39,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273845101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:39,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:39,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 09:00:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083419016] [2022-04-08 09:00:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:39,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:39,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,879 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-08 09:00:39,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 09:00:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 09:00:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-08 09:00:39,881 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:39,950 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-08 09:00:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:00:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:00:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 09:00:39,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-08 09:00:39,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:39,975 INFO L225 Difference]: With dead ends: 29 [2022-04-08 09:00:39,975 INFO L226 Difference]: Without dead ends: 21 [2022-04-08 09:00:39,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:00:39,977 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:39,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-08 09:00:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-08 09:00:39,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:39,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-08 09:00:39,999 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-08 09:00:39,999 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-08 09:00:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:40,000 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 09:00:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:00:40,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:40,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:40,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-04-08 09:00:40,001 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-04-08 09:00:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:40,002 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-08 09:00:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:00:40,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:40,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:40,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:40,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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-08 09:00:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-08 09:00:40,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2022-04-08 09:00:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:40,003 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-08 09:00:40,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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-08 09:00:40,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-08 09:00:40,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-08 09:00:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:00:40,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:40,022 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:40,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 09:00:40,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:40,238 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1107532713, now seen corresponding path program 5 times [2022-04-08 09:00:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:40,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230919746] [2022-04-08 09:00:40,246 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:40,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1107532713, now seen corresponding path program 6 times [2022-04-08 09:00:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001423053] [2022-04-08 09:00:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:40,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:40,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#(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); {1098#true} is VALID [2022-04-08 09:00:40,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-04-08 09:00:40,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1098#true} {1098#true} #47#return; {1098#true} is VALID [2022-04-08 09:00:40,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:40,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#(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); {1098#true} is VALID [2022-04-08 09:00:40,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-04-08 09:00:40,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #47#return; {1098#true} is VALID [2022-04-08 09:00:40,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret3 := main(); {1098#true} is VALID [2022-04-08 09:00:40,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#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; {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:40,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:40,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1104#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:40,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:40,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0); {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:40,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1106#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:40,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-08 09:00:40,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {1105#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} assume !!(~i~0 <= ~n~0); {1107#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} is VALID [2022-04-08 09:00:40,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1107#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1108#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-08 09:00:40,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1109#(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-08 09:00:40,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1109#(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)))} assume !(~i~0 <= ~n~0); {1110#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:40,428 INFO L272 TraceCheckUtils]: 16: Hoare triple {1110#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:00:40,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:00:40,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {1112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1099#false} is VALID [2022-04-08 09:00:40,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2022-04-08 09:00:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:00:40,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001423053] [2022-04-08 09:00:40,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001423053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87953488] [2022-04-08 09:00:40,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:40,431 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-08 09:00:40,432 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-08 09:00:40,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 09:00:40,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:40,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 09:00:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:40,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:40,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2022-04-08 09:00:40,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#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); {1098#true} is VALID [2022-04-08 09:00:40,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-04-08 09:00:40,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #47#return; {1098#true} is VALID [2022-04-08 09:00:40,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret3 := main(); {1098#true} is VALID [2022-04-08 09:00:40,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#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; {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:40,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume !!(~i~0 <= ~n~0); {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 09:00:40,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1103#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1104#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:40,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {1104#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1141#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:40,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1141#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-08 09:00:40,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1148#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-08 09:00:40,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1148#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1152#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:00:40,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} assume !!(~i~0 <= ~n~0); {1156#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:00:40,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1156#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1160#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-08 09:00:40,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1164#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-08 09:00:40,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1164#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {1168#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-08 09:00:40,886 INFO L272 TraceCheckUtils]: 16: Hoare triple {1168#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:40,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:40,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1099#false} is VALID [2022-04-08 09:00:40,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2022-04-08 09:00:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:40,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:41,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2022-04-08 09:00:41,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1099#false} is VALID [2022-04-08 09:00:41,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {1172#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1176#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:00:41,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {1192#(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)); {1172#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:00:41,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {1196#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {1192#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:41,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {1200#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1196#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:41,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {1204#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1200#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-08 09:00:41,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1208#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {1204#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:41,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {1212#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1208#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:41,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {1216#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1212#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-08 09:00:41,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1216#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} assume !!(~i~0 <= ~n~0); {1216#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:41,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1223#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1216#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:41,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1223#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-08 09:00:41,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {1227#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} assume !!(~i~0 <= ~n~0); {1227#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-08 09:00:41,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#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; {1227#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-08 09:00:41,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {1098#true} call #t~ret3 := main(); {1098#true} is VALID [2022-04-08 09:00:41,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1098#true} {1098#true} #47#return; {1098#true} is VALID [2022-04-08 09:00:41,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-04-08 09:00:41,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#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); {1098#true} is VALID [2022-04-08 09:00:41,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {1098#true} call ULTIMATE.init(); {1098#true} is VALID [2022-04-08 09:00:41,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:41,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87953488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:41,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:41,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-08 09:00:41,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:41,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230919746] [2022-04-08 09:00:41,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230919746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:41,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:41,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 09:00:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144591131] [2022-04-08 09:00:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:41,351 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:41,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,362 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-08 09:00:41,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 09:00:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 09:00:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-08 09:00:41,363 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:41,714 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-08 09:00:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:00:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2022-04-08 09:00:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 28 transitions. [2022-04-08 09:00:41,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 28 transitions. [2022-04-08 09:00:41,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:41,737 INFO L225 Difference]: With dead ends: 30 [2022-04-08 09:00:41,737 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 09:00:41,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 09:00:41,739 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:41,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 09:00:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-08 09:00:41,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:41,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 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-08 09:00:41,762 INFO L74 IsIncluded]: Start isIncluded. First operand 25 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-08 09:00:41,762 INFO L87 Difference]: Start difference. First operand 25 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-08 09:00:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:41,765 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:00:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:00:41,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:41,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:41,765 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 25 states. [2022-04-08 09:00:41,766 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 25 states. [2022-04-08 09:00:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:41,768 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 09:00:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:00:41,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:41,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:41,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:41,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:41,769 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-08 09:00:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-08 09:00:41,772 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2022-04-08 09:00:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:41,773 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-08 09:00:41,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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-08 09:00:41,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-08 09:00:41,791 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-08 09:00:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-08 09:00:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:00:41,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:41,792 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:41,810 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-08 09:00:42,008 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,008 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 3 times [2022-04-08 09:00:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:42,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [276041179] [2022-04-08 09:00:42,015 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:42,015 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 4 times [2022-04-08 09:00:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:42,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718596969] [2022-04-08 09:00:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {1431#(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); {1423#true} is VALID [2022-04-08 09:00:42,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#true} assume true; {1423#true} is VALID [2022-04-08 09:00:42,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1423#true} {1423#true} #47#return; {1423#true} is VALID [2022-04-08 09:00:42,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1423#true} call ULTIMATE.init(); {1431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:42,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1431#(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); {1423#true} is VALID [2022-04-08 09:00:42,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {1423#true} assume true; {1423#true} is VALID [2022-04-08 09:00:42,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1423#true} {1423#true} #47#return; {1423#true} is VALID [2022-04-08 09:00:42,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {1423#true} call #t~ret3 := main(); {1423#true} is VALID [2022-04-08 09:00:42,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {1423#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; {1428#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {1428#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1428#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {1429#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {1429#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1430#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1430#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#(<= main_~i~0 3)} assume !(~i~0 < 10); {1424#false} is VALID [2022-04-08 09:00:42,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1424#false} is VALID [2022-04-08 09:00:42,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1424#false} assume !(~i~0 <= ~n~0); {1424#false} is VALID [2022-04-08 09:00:42,062 INFO L272 TraceCheckUtils]: 16: Hoare triple {1424#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1424#false} is VALID [2022-04-08 09:00:42,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#false} ~cond := #in~cond; {1424#false} is VALID [2022-04-08 09:00:42,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1424#false} assume 0 == ~cond; {1424#false} is VALID [2022-04-08 09:00:42,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-04-08 09:00:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:42,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718596969] [2022-04-08 09:00:42,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718596969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:42,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311076265] [2022-04-08 09:00:42,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:42,064 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-08 09:00:42,065 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-08 09:00:42,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:42,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:42,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 09:00:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:42,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {1423#true} call ULTIMATE.init(); {1423#true} is VALID [2022-04-08 09:00:42,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#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); {1423#true} is VALID [2022-04-08 09:00:42,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {1423#true} assume true; {1423#true} is VALID [2022-04-08 09:00:42,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1423#true} {1423#true} #47#return; {1423#true} is VALID [2022-04-08 09:00:42,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {1423#true} call #t~ret3 := main(); {1423#true} is VALID [2022-04-08 09:00:42,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {1423#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; {1450#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1450#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1450#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {1450#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {1429#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {1429#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1429#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {1429#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1430#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1430#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {1430#(<= main_~i~0 3)} assume !(~i~0 < 10); {1424#false} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1424#false} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {1424#false} assume !(~i~0 <= ~n~0); {1424#false} is VALID [2022-04-08 09:00:42,157 INFO L272 TraceCheckUtils]: 16: Hoare triple {1424#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1424#false} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#false} ~cond := #in~cond; {1424#false} is VALID [2022-04-08 09:00:42,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {1424#false} assume 0 == ~cond; {1424#false} is VALID [2022-04-08 09:00:42,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-04-08 09:00:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:42,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:42,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#false} assume !false; {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1424#false} assume 0 == ~cond; {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#false} ~cond := #in~cond; {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L272 TraceCheckUtils]: 16: Hoare triple {1424#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {1424#false} assume !(~i~0 <= ~n~0); {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1424#false} is VALID [2022-04-08 09:00:42,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#(< main_~i~0 10)} assume !(~i~0 < 10); {1424#false} is VALID [2022-04-08 09:00:42,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {1511#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {1511#(< main_~i~0 10)} is VALID [2022-04-08 09:00:42,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1511#(< main_~i~0 10)} is VALID [2022-04-08 09:00:42,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {1518#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1518#(< main_~i~0 9)} is VALID [2022-04-08 09:00:42,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {1518#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1518#(< main_~i~0 9)} is VALID [2022-04-08 09:00:42,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {1528#(< main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1518#(< main_~i~0 9)} is VALID [2022-04-08 09:00:42,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1528#(< main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1528#(< main_~i~0 8)} is VALID [2022-04-08 09:00:42,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1528#(< main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1528#(< main_~i~0 8)} is VALID [2022-04-08 09:00:42,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1423#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; {1528#(< main_~i~0 8)} is VALID [2022-04-08 09:00:42,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {1423#true} call #t~ret3 := main(); {1423#true} is VALID [2022-04-08 09:00:42,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1423#true} {1423#true} #47#return; {1423#true} is VALID [2022-04-08 09:00:42,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1423#true} assume true; {1423#true} is VALID [2022-04-08 09:00:42,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1423#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); {1423#true} is VALID [2022-04-08 09:00:42,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1423#true} call ULTIMATE.init(); {1423#true} is VALID [2022-04-08 09:00:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:42,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311076265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:42,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 09:00:42,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:42,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [276041179] [2022-04-08 09:00:42,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [276041179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:42,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:42,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:00:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430704790] [2022-04-08 09:00:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:42,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:42,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,263 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-08 09:00:42,263 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:00:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:00:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:00:42,264 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:42,360 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 09:00:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:00:42,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:00:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-08 09:00:42,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-08 09:00:42,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:42,383 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:00:42,383 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 09:00:42,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:42,384 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:42,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 09:00:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 09:00:42,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:42,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 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-08 09:00:42,417 INFO L74 IsIncluded]: Start isIncluded. First operand 26 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-08 09:00:42,417 INFO L87 Difference]: Start difference. First operand 26 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-08 09:00:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:42,417 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 09:00:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 09:00:42,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:42,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:42,418 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 26 states. [2022-04-08 09:00:42,418 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 26 states. [2022-04-08 09:00:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:42,419 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 09:00:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 09:00:42,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:42,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:42,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:42,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:42,419 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-08 09:00:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 09:00:42,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-08 09:00:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:42,420 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 09:00:42,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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-08 09:00:42,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 09:00:42,442 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-08 09:00:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 09:00:42,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 09:00:42,442 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:42,443 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:42,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 09:00:42,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,659 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 5 times [2022-04-08 09:00:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:42,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855471854] [2022-04-08 09:00:42,664 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:42,665 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 6 times [2022-04-08 09:00:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:42,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601747917] [2022-04-08 09:00:42,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {1740#(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); {1731#true} is VALID [2022-04-08 09:00:42,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1731#true} assume true; {1731#true} is VALID [2022-04-08 09:00:42,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1731#true} {1731#true} #47#return; {1731#true} is VALID [2022-04-08 09:00:42,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {1731#true} call ULTIMATE.init(); {1740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:42,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#(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); {1731#true} is VALID [2022-04-08 09:00:42,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#true} assume true; {1731#true} is VALID [2022-04-08 09:00:42,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#true} {1731#true} #47#return; {1731#true} is VALID [2022-04-08 09:00:42,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#true} call #t~ret3 := main(); {1731#true} is VALID [2022-04-08 09:00:42,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#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; {1736#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {1736#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {1736#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1736#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1736#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:42,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1736#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {1738#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1738#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {1738#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1739#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {1739#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1739#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {1739#(<= main_~i~0 4)} assume !(~i~0 < 10); {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {1732#false} assume !(~i~0 <= ~n~0); {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L272 TraceCheckUtils]: 19: Hoare triple {1732#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {1732#false} ~cond := #in~cond; {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {1732#false} assume 0 == ~cond; {1732#false} is VALID [2022-04-08 09:00:42,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {1732#false} assume !false; {1732#false} is VALID [2022-04-08 09:00:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:42,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601747917] [2022-04-08 09:00:42,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601747917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:42,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345675846] [2022-04-08 09:00:42,737 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:42,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:42,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:42,738 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-08 09:00:42,739 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-08 09:00:42,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 09:00:42,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:42,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:00:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:42,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:42,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {1731#true} call ULTIMATE.init(); {1731#true} is VALID [2022-04-08 09:00:42,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1731#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); {1731#true} is VALID [2022-04-08 09:00:42,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#true} assume true; {1731#true} is VALID [2022-04-08 09:00:42,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#true} {1731#true} #47#return; {1731#true} is VALID [2022-04-08 09:00:42,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#true} call #t~ret3 := main(); {1731#true} is VALID [2022-04-08 09:00:42,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#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; {1759#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {1759#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1759#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {1759#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1759#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:42,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1737#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1737#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:42,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {1737#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {1738#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {1738#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1738#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:42,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {1738#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1739#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {1739#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1739#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1739#(<= main_~i~0 4)} assume !(~i~0 < 10); {1732#false} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1732#false} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {1732#false} assume !(~i~0 <= ~n~0); {1732#false} is VALID [2022-04-08 09:00:42,864 INFO L272 TraceCheckUtils]: 19: Hoare triple {1732#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1732#false} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1732#false} ~cond := #in~cond; {1732#false} is VALID [2022-04-08 09:00:42,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1732#false} assume 0 == ~cond; {1732#false} is VALID [2022-04-08 09:00:42,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {1732#false} assume !false; {1732#false} is VALID [2022-04-08 09:00:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:42,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:43,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {1732#false} assume !false; {1732#false} is VALID [2022-04-08 09:00:43,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {1732#false} assume 0 == ~cond; {1732#false} is VALID [2022-04-08 09:00:43,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {1732#false} ~cond := #in~cond; {1732#false} is VALID [2022-04-08 09:00:43,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {1732#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1732#false} is VALID [2022-04-08 09:00:43,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {1732#false} assume !(~i~0 <= ~n~0); {1732#false} is VALID [2022-04-08 09:00:43,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1732#false} is VALID [2022-04-08 09:00:43,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {1829#(< main_~i~0 10)} assume !(~i~0 < 10); {1732#false} is VALID [2022-04-08 09:00:43,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {1829#(< main_~i~0 10)} is VALID [2022-04-08 09:00:43,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1829#(< main_~i~0 10)} is VALID [2022-04-08 09:00:43,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1836#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {1836#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1836#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(< main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1836#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {1846#(< main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1846#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#(< main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1846#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1856#(< main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1846#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {1856#(< main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1856#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {1856#(< main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1856#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#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; {1856#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#true} call #t~ret3 := main(); {1731#true} is VALID [2022-04-08 09:00:43,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#true} {1731#true} #47#return; {1731#true} is VALID [2022-04-08 09:00:43,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#true} assume true; {1731#true} is VALID [2022-04-08 09:00:43,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {1731#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); {1731#true} is VALID [2022-04-08 09:00:43,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {1731#true} call ULTIMATE.init(); {1731#true} is VALID [2022-04-08 09:00:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345675846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:43,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 09:00:43,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:43,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855471854] [2022-04-08 09:00:43,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855471854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:43,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:43,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:00:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528882535] [2022-04-08 09:00:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:43,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:43,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,038 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-08 09:00:43,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:00:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:00:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:00:43,039 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:43,169 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 09:00:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:00:43,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 09:00:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-08 09:00:43,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-08 09:00:43,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:43,201 INFO L225 Difference]: With dead ends: 37 [2022-04-08 09:00:43,201 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 09:00:43,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:00:43,202 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:43,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 09:00:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-08 09:00:43,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:43,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 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-08 09:00:43,250 INFO L74 IsIncluded]: Start isIncluded. First operand 29 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-08 09:00:43,250 INFO L87 Difference]: Start difference. First operand 29 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-08 09:00:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:43,251 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 09:00:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 09:00:43,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:43,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:43,252 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 29 states. [2022-04-08 09:00:43,252 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 29 states. [2022-04-08 09:00:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:43,253 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-08 09:00:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 09:00:43,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:43,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:43,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:43,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:43,254 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-08 09:00:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-08 09:00:43,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2022-04-08 09:00:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:43,255 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-08 09:00:43,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-08 09:00:43,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-08 09:00:43,283 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-08 09:00:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-08 09:00:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 09:00:43,283 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:43,283 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:43,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:43,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:43,494 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1448012981, now seen corresponding path program 7 times [2022-04-08 09:00:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:43,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147593004] [2022-04-08 09:00:43,500 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:43,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:43,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1448012981, now seen corresponding path program 8 times [2022-04-08 09:00:43,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:43,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436079644] [2022-04-08 09:00:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:43,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {2089#(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); {2079#true} is VALID [2022-04-08 09:00:43,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {2079#true} assume true; {2079#true} is VALID [2022-04-08 09:00:43,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2079#true} {2079#true} #47#return; {2079#true} is VALID [2022-04-08 09:00:43,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {2079#true} call ULTIMATE.init(); {2089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:43,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2089#(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); {2079#true} is VALID [2022-04-08 09:00:43,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2079#true} assume true; {2079#true} is VALID [2022-04-08 09:00:43,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2079#true} {2079#true} #47#return; {2079#true} is VALID [2022-04-08 09:00:43,622 INFO L272 TraceCheckUtils]: 4: Hoare triple {2079#true} call #t~ret3 := main(); {2079#true} is VALID [2022-04-08 09:00:43,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {2079#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; {2084#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:43,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {2084#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {2084#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:43,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {2084#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2084#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:43,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {2084#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {2085#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {2085#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2085#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {2086#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2086#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {2087#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {2087#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {2087#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#(<= main_~i~0 5)} assume !(~i~0 < 10); {2080#false} is VALID [2022-04-08 09:00:43,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {2080#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {2080#false} assume !(~i~0 <= ~n~0); {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L272 TraceCheckUtils]: 22: Hoare triple {2080#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {2080#false} ~cond := #in~cond; {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {2080#false} assume 0 == ~cond; {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {2080#false} assume !false; {2080#false} is VALID [2022-04-08 09:00:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436079644] [2022-04-08 09:00:43,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436079644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:43,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218336448] [2022-04-08 09:00:43,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:43,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:43,645 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-08 09:00:43,669 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-08 09:00:43,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:43,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:43,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:00:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:43,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:43,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {2079#true} call ULTIMATE.init(); {2079#true} is VALID [2022-04-08 09:00:43,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {2079#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); {2079#true} is VALID [2022-04-08 09:00:43,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2079#true} assume true; {2079#true} is VALID [2022-04-08 09:00:43,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2079#true} {2079#true} #47#return; {2079#true} is VALID [2022-04-08 09:00:43,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {2079#true} call #t~ret3 := main(); {2079#true} is VALID [2022-04-08 09:00:43,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {2079#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; {2108#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:43,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {2108#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2108#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:43,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2108#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:43,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {2108#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {2085#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {2085#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2085#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:43,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {2085#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {2086#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {2086#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2086#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:43,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {2087#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {2087#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2087#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:43,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {2087#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {2088#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {2088#(<= main_~i~0 5)} assume !(~i~0 < 10); {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {2080#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {2080#false} assume !(~i~0 <= ~n~0); {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L272 TraceCheckUtils]: 22: Hoare triple {2080#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {2080#false} ~cond := #in~cond; {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {2080#false} assume 0 == ~cond; {2080#false} is VALID [2022-04-08 09:00:43,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {2080#false} assume !false; {2080#false} is VALID [2022-04-08 09:00:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:43,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:43,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2080#false} assume !false; {2080#false} is VALID [2022-04-08 09:00:43,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {2080#false} assume 0 == ~cond; {2080#false} is VALID [2022-04-08 09:00:43,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {2080#false} ~cond := #in~cond; {2080#false} is VALID [2022-04-08 09:00:43,969 INFO L272 TraceCheckUtils]: 22: Hoare triple {2080#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2080#false} is VALID [2022-04-08 09:00:43,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {2080#false} assume !(~i~0 <= ~n~0); {2080#false} is VALID [2022-04-08 09:00:43,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {2080#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2080#false} is VALID [2022-04-08 09:00:43,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {2187#(< main_~i~0 10)} assume !(~i~0 < 10); {2080#false} is VALID [2022-04-08 09:00:43,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {2187#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {2187#(< main_~i~0 10)} is VALID [2022-04-08 09:00:43,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {2194#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2187#(< main_~i~0 10)} is VALID [2022-04-08 09:00:43,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {2194#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2194#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {2194#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {2194#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {2204#(< main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2194#(< main_~i~0 9)} is VALID [2022-04-08 09:00:43,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {2204#(< main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2204#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {2204#(< main_~i~0 8)} assume !!(~i~0 <= ~n~0); {2204#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {2214#(< main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2204#(< main_~i~0 8)} is VALID [2022-04-08 09:00:43,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2214#(< main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2214#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {2214#(< main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2214#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {2088#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2214#(< main_~i~0 7)} is VALID [2022-04-08 09:00:43,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {2088#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {2088#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {2079#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; {2088#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:43,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {2079#true} call #t~ret3 := main(); {2079#true} is VALID [2022-04-08 09:00:43,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2079#true} {2079#true} #47#return; {2079#true} is VALID [2022-04-08 09:00:43,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2079#true} assume true; {2079#true} is VALID [2022-04-08 09:00:43,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2079#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); {2079#true} is VALID [2022-04-08 09:00:43,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {2079#true} call ULTIMATE.init(); {2079#true} is VALID [2022-04-08 09:00:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:43,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218336448] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:43,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:43,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-08 09:00:43,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:43,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147593004] [2022-04-08 09:00:43,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147593004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:43,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:43,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:00:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399176027] [2022-04-08 09:00:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:43,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:43,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:43,987 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-08 09:00:43,987 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:00:43,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:00:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:43,987 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:44,099 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-08 09:00:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:00:44,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 09:00:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 09:00:44,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-08 09:00:44,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:44,123 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:00:44,124 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 09:00:44,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=177, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:00:44,124 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:44,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 09:00:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-08 09:00:44,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:44,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 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-08 09:00:44,160 INFO L74 IsIncluded]: Start isIncluded. First operand 32 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-08 09:00:44,160 INFO L87 Difference]: Start difference. First operand 32 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-08 09:00:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:44,161 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-08 09:00:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-08 09:00:44,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:44,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:44,171 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 32 states. [2022-04-08 09:00:44,171 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 32 states. [2022-04-08 09:00:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:44,172 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-08 09:00:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-08 09:00:44,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:44,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:44,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:44,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:44,172 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-08 09:00:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-08 09:00:44,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 26 [2022-04-08 09:00:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:44,175 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-08 09:00:44,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 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-08 09:00:44,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-08 09:00:44,201 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-08 09:00:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-08 09:00:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 09:00:44,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:44,202 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:44,237 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-08 09:00:44,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:44,403 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:44,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 319282542, now seen corresponding path program 9 times [2022-04-08 09:00:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:44,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684008059] [2022-04-08 09:00:44,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:44,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash 319282542, now seen corresponding path program 10 times [2022-04-08 09:00:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:44,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119178943] [2022-04-08 09:00:44,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:44,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:44,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {2477#(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); {2466#true} is VALID [2022-04-08 09:00:44,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2466#true} assume true; {2466#true} is VALID [2022-04-08 09:00:44,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2466#true} {2466#true} #47#return; {2466#true} is VALID [2022-04-08 09:00:44,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {2466#true} call ULTIMATE.init(); {2477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:44,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {2477#(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); {2466#true} is VALID [2022-04-08 09:00:44,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2466#true} assume true; {2466#true} is VALID [2022-04-08 09:00:44,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2466#true} {2466#true} #47#return; {2466#true} is VALID [2022-04-08 09:00:44,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {2466#true} call #t~ret3 := main(); {2466#true} is VALID [2022-04-08 09:00:44,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {2466#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; {2471#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:44,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {2471#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {2471#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:44,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {2471#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2471#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:44,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {2471#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {2472#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {2473#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2473#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2473#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2474#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {2474#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {2474#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {2476#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#(<= main_~i~0 6)} assume !(~i~0 < 10); {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {2467#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#false} assume !(~i~0 <= ~n~0); {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L272 TraceCheckUtils]: 25: Hoare triple {2467#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {2467#false} ~cond := #in~cond; {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {2467#false} assume 0 == ~cond; {2467#false} is VALID [2022-04-08 09:00:44,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {2467#false} assume !false; {2467#false} is VALID [2022-04-08 09:00:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:44,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119178943] [2022-04-08 09:00:44,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119178943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:44,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727108414] [2022-04-08 09:00:44,495 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:44,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:44,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:44,496 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-08 09:00:44,498 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-08 09:00:44,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:44,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:44,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 09:00:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:44,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:44,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {2466#true} call ULTIMATE.init(); {2466#true} is VALID [2022-04-08 09:00:44,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {2466#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); {2466#true} is VALID [2022-04-08 09:00:44,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {2466#true} assume true; {2466#true} is VALID [2022-04-08 09:00:44,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2466#true} {2466#true} #47#return; {2466#true} is VALID [2022-04-08 09:00:44,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {2466#true} call #t~ret3 := main(); {2466#true} is VALID [2022-04-08 09:00:44,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {2466#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; {2496#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:44,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {2496#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2496#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:44,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {2496#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2496#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:44,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {2496#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {2472#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2472#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:44,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {2472#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {2473#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {2473#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2473#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:44,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {2473#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {2474#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {2474#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {2474#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {2475#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {2475#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {2476#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#(<= main_~i~0 6)} assume !(~i~0 < 10); {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {2467#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#false} assume !(~i~0 <= ~n~0); {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L272 TraceCheckUtils]: 25: Hoare triple {2467#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {2467#false} ~cond := #in~cond; {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {2467#false} assume 0 == ~cond; {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {2467#false} assume !false; {2467#false} is VALID [2022-04-08 09:00:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:44,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:44,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {2467#false} assume !false; {2467#false} is VALID [2022-04-08 09:00:44,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {2467#false} assume 0 == ~cond; {2467#false} is VALID [2022-04-08 09:00:44,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {2467#false} ~cond := #in~cond; {2467#false} is VALID [2022-04-08 09:00:44,723 INFO L272 TraceCheckUtils]: 25: Hoare triple {2467#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2467#false} is VALID [2022-04-08 09:00:44,723 INFO L290 TraceCheckUtils]: 24: Hoare triple {2467#false} assume !(~i~0 <= ~n~0); {2467#false} is VALID [2022-04-08 09:00:44,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {2467#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2467#false} is VALID [2022-04-08 09:00:44,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {2584#(< main_~i~0 10)} assume !(~i~0 < 10); {2467#false} is VALID [2022-04-08 09:00:44,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {2584#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {2584#(< main_~i~0 10)} is VALID [2022-04-08 09:00:44,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {2591#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2584#(< main_~i~0 10)} is VALID [2022-04-08 09:00:44,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {2591#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2591#(< main_~i~0 9)} is VALID [2022-04-08 09:00:44,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {2591#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {2591#(< main_~i~0 9)} is VALID [2022-04-08 09:00:44,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#(< main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2591#(< main_~i~0 9)} is VALID [2022-04-08 09:00:44,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {2601#(< main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2601#(< main_~i~0 8)} is VALID [2022-04-08 09:00:44,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {2601#(< main_~i~0 8)} assume !!(~i~0 <= ~n~0); {2601#(< main_~i~0 8)} is VALID [2022-04-08 09:00:44,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2601#(< main_~i~0 8)} is VALID [2022-04-08 09:00:44,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2476#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:44,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {2475#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {2474#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2475#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:44,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2474#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {2474#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {2466#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; {2474#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:44,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {2466#true} call #t~ret3 := main(); {2466#true} is VALID [2022-04-08 09:00:44,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2466#true} {2466#true} #47#return; {2466#true} is VALID [2022-04-08 09:00:44,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {2466#true} assume true; {2466#true} is VALID [2022-04-08 09:00:44,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {2466#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); {2466#true} is VALID [2022-04-08 09:00:44,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2466#true} call ULTIMATE.init(); {2466#true} is VALID [2022-04-08 09:00:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727108414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:44,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-08 09:00:44,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:44,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684008059] [2022-04-08 09:00:44,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684008059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:44,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 09:00:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181564055] [2022-04-08 09:00:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:44,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,740 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-08 09:00:44,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 09:00:44,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:44,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 09:00:44,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:44,741 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:44,930 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-08 09:00:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 09:00:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-08 09:00:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-08 09:00:44,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2022-04-08 09:00:44,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:44,958 INFO L225 Difference]: With dead ends: 43 [2022-04-08 09:00:44,958 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 09:00:44,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2022-04-08 09:00:44,959 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:44,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:00:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 09:00:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 09:00:45,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:45,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 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-08 09:00:45,012 INFO L74 IsIncluded]: Start isIncluded. First operand 35 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-08 09:00:45,014 INFO L87 Difference]: Start difference. First operand 35 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-08 09:00:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:45,014 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 09:00:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-08 09:00:45,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:45,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:45,015 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 35 states. [2022-04-08 09:00:45,015 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 35 states. [2022-04-08 09:00:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:45,016 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-08 09:00:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-08 09:00:45,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:45,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:45,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:45,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:45,016 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-08 09:00:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-08 09:00:45,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 29 [2022-04-08 09:00:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:45,018 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-08 09:00:45,018 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 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-08 09:00:45,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2022-04-08 09:00:45,048 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-08 09:00:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-08 09:00:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 09:00:45,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:45,051 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:45,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:45,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 09:00:45,267 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2111093867, now seen corresponding path program 11 times [2022-04-08 09:00:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325891992] [2022-04-08 09:00:45,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:45,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2111093867, now seen corresponding path program 12 times [2022-04-08 09:00:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:45,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324308694] [2022-04-08 09:00:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:45,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {2903#(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); {2891#true} is VALID [2022-04-08 09:00:45,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {2891#true} assume true; {2891#true} is VALID [2022-04-08 09:00:45,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2891#true} {2891#true} #47#return; {2891#true} is VALID [2022-04-08 09:00:45,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {2891#true} call ULTIMATE.init(); {2903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:45,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {2903#(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); {2891#true} is VALID [2022-04-08 09:00:45,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {2891#true} assume true; {2891#true} is VALID [2022-04-08 09:00:45,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2891#true} {2891#true} #47#return; {2891#true} is VALID [2022-04-08 09:00:45,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {2891#true} call #t~ret3 := main(); {2891#true} is VALID [2022-04-08 09:00:45,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {2891#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; {2896#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:45,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {2896#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {2896#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:45,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {2896#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2896#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:45,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {2896#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {2897#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {2898#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2898#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {2900#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {2900#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2900#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {2901#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {2901#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {2902#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {2902#(<= main_~i~0 7)} assume !(~i~0 < 10); {2892#false} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {2892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2892#false} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {2892#false} assume !(~i~0 <= ~n~0); {2892#false} is VALID [2022-04-08 09:00:45,368 INFO L272 TraceCheckUtils]: 28: Hoare triple {2892#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2892#false} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {2892#false} ~cond := #in~cond; {2892#false} is VALID [2022-04-08 09:00:45,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {2892#false} assume 0 == ~cond; {2892#false} is VALID [2022-04-08 09:00:45,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {2892#false} assume !false; {2892#false} is VALID [2022-04-08 09:00:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:45,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324308694] [2022-04-08 09:00:45,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324308694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:45,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277244670] [2022-04-08 09:00:45,369 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 09:00:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:45,370 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-08 09:00:45,371 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-08 09:00:45,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-08 09:00:45,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:45,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 09:00:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:45,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:45,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {2891#true} call ULTIMATE.init(); {2891#true} is VALID [2022-04-08 09:00:45,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {2891#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); {2891#true} is VALID [2022-04-08 09:00:45,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {2891#true} assume true; {2891#true} is VALID [2022-04-08 09:00:45,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2891#true} {2891#true} #47#return; {2891#true} is VALID [2022-04-08 09:00:45,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {2891#true} call #t~ret3 := main(); {2891#true} is VALID [2022-04-08 09:00:45,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {2891#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; {2922#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:45,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {2922#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2922#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:45,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {2922#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2922#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:45,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {2922#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2897#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:45,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {2897#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {2898#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {2898#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {2898#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {2899#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {2899#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {2900#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {2900#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {2900#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {2901#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {2901#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {2902#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {2902#(<= main_~i~0 7)} assume !(~i~0 < 10); {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {2892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {2892#false} assume !(~i~0 <= ~n~0); {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L272 TraceCheckUtils]: 28: Hoare triple {2892#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {2892#false} ~cond := #in~cond; {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {2892#false} assume 0 == ~cond; {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {2892#false} assume !false; {2892#false} is VALID [2022-04-08 09:00:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:45,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:45,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {2892#false} assume !false; {2892#false} is VALID [2022-04-08 09:00:45,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {2892#false} assume 0 == ~cond; {2892#false} is VALID [2022-04-08 09:00:45,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {2892#false} ~cond := #in~cond; {2892#false} is VALID [2022-04-08 09:00:45,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {2892#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2892#false} is VALID [2022-04-08 09:00:45,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {2892#false} assume !(~i~0 <= ~n~0); {2892#false} is VALID [2022-04-08 09:00:45,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {2892#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2892#false} is VALID [2022-04-08 09:00:45,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {3019#(< main_~i~0 10)} assume !(~i~0 < 10); {2892#false} is VALID [2022-04-08 09:00:45,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {3019#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {3019#(< main_~i~0 10)} is VALID [2022-04-08 09:00:45,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {3026#(< main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3019#(< main_~i~0 10)} is VALID [2022-04-08 09:00:45,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {3026#(< main_~i~0 9)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3026#(< main_~i~0 9)} is VALID [2022-04-08 09:00:45,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {3026#(< main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3026#(< main_~i~0 9)} is VALID [2022-04-08 09:00:45,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {2902#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3026#(< main_~i~0 9)} is VALID [2022-04-08 09:00:45,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {2902#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {2902#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {2901#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2902#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:45,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {2901#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {2901#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2901#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:45,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {2899#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2900#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:45,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {2899#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {2898#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2899#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:45,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {2898#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {2898#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {2891#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; {2898#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:45,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {2891#true} call #t~ret3 := main(); {2891#true} is VALID [2022-04-08 09:00:45,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2891#true} {2891#true} #47#return; {2891#true} is VALID [2022-04-08 09:00:45,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2891#true} assume true; {2891#true} is VALID [2022-04-08 09:00:45,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2891#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); {2891#true} is VALID [2022-04-08 09:00:45,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {2891#true} call ULTIMATE.init(); {2891#true} is VALID [2022-04-08 09:00:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277244670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:45,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2022-04-08 09:00:45,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325891992] [2022-04-08 09:00:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325891992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 09:00:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131766097] [2022-04-08 09:00:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:45,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,683 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-08 09:00:45,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 09:00:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 09:00:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:45,683 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:45,858 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-08 09:00:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 09:00:45,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-08 09:00:45,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-08 09:00:45,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-08 09:00:45,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:45,895 INFO L225 Difference]: With dead ends: 46 [2022-04-08 09:00:45,895 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 09:00:45,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=227, Unknown=0, NotChecked=0, Total=380 [2022-04-08 09:00:45,896 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:45,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 24 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 09:00:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 09:00:45,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:45,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 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-08 09:00:45,957 INFO L74 IsIncluded]: Start isIncluded. First operand 38 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-08 09:00:45,957 INFO L87 Difference]: Start difference. First operand 38 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-08 09:00:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:45,958 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-08 09:00:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-08 09:00:45,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:45,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:45,958 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 38 states. [2022-04-08 09:00:45,958 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 38 states. [2022-04-08 09:00:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:45,959 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-08 09:00:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-08 09:00:45,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:45,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:45,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:45,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:45,959 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-08 09:00:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-08 09:00:45,960 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 32 [2022-04-08 09:00:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:45,960 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-08 09:00:45,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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-08 09:00:45,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-08 09:00:45,999 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-08 09:00:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 09:00:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 09:00:46,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:46,000 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:46,019 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-08 09:00:46,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:46,217 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:46,217 INFO L85 PathProgramCache]: Analyzing trace with hash -186245042, now seen corresponding path program 13 times [2022-04-08 09:00:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:46,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883264138] [2022-04-08 09:00:46,223 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:46,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -186245042, now seen corresponding path program 14 times [2022-04-08 09:00:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062958539] [2022-04-08 09:00:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:46,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:46,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {3367#(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); {3354#true} is VALID [2022-04-08 09:00:46,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#true} assume true; {3354#true} is VALID [2022-04-08 09:00:46,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3354#true} {3354#true} #47#return; {3354#true} is VALID [2022-04-08 09:00:46,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {3354#true} call ULTIMATE.init(); {3367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {3367#(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); {3354#true} is VALID [2022-04-08 09:00:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {3354#true} assume true; {3354#true} is VALID [2022-04-08 09:00:46,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3354#true} {3354#true} #47#return; {3354#true} is VALID [2022-04-08 09:00:46,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {3354#true} call #t~ret3 := main(); {3354#true} is VALID [2022-04-08 09:00:46,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {3354#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; {3359#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:46,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {3359#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {3359#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:46,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {3359#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3359#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:46,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {3360#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {3360#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {3361#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {3361#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {3361#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {3363#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {3363#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {3363#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {3364#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {3364#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {3364#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {3365#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {3365#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {3365#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 27: Hoare triple {3366#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 28: Hoare triple {3366#(<= main_~i~0 8)} assume !(~i~0 < 10); {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {3355#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {3355#false} assume !(~i~0 <= ~n~0); {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L272 TraceCheckUtils]: 31: Hoare triple {3355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {3355#false} ~cond := #in~cond; {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {3355#false} assume 0 == ~cond; {3355#false} is VALID [2022-04-08 09:00:46,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {3355#false} assume !false; {3355#false} is VALID [2022-04-08 09:00:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062958539] [2022-04-08 09:00:46,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062958539] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905884743] [2022-04-08 09:00:46,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:00:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:46,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:46,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 09:00:46,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:00:46,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:46,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 09:00:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:46,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:46,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {3354#true} call ULTIMATE.init(); {3354#true} is VALID [2022-04-08 09:00:46,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#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); {3354#true} is VALID [2022-04-08 09:00:46,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {3354#true} assume true; {3354#true} is VALID [2022-04-08 09:00:46,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3354#true} {3354#true} #47#return; {3354#true} is VALID [2022-04-08 09:00:46,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {3354#true} call #t~ret3 := main(); {3354#true} is VALID [2022-04-08 09:00:46,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {3354#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; {3386#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:46,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {3386#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3386#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:46,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {3386#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3386#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:46,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {3386#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {3360#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {3360#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {3361#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {3361#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {3361#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {3363#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {3363#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {3363#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {3364#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {3364#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {3364#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {3365#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {3365#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {3365#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {3366#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {3366#(<= main_~i~0 8)} assume !(~i~0 < 10); {3355#false} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {3355#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3355#false} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {3355#false} assume !(~i~0 <= ~n~0); {3355#false} is VALID [2022-04-08 09:00:46,544 INFO L272 TraceCheckUtils]: 31: Hoare triple {3355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3355#false} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {3355#false} ~cond := #in~cond; {3355#false} is VALID [2022-04-08 09:00:46,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {3355#false} assume 0 == ~cond; {3355#false} is VALID [2022-04-08 09:00:46,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {3355#false} assume !false; {3355#false} is VALID [2022-04-08 09:00:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:46,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:46,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {3355#false} assume !false; {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {3355#false} assume 0 == ~cond; {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {3355#false} ~cond := #in~cond; {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L272 TraceCheckUtils]: 31: Hoare triple {3355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {3355#false} assume !(~i~0 <= ~n~0); {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {3355#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3355#false} is VALID [2022-04-08 09:00:46,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {3492#(< main_~i~0 10)} assume !(~i~0 < 10); {3355#false} is VALID [2022-04-08 09:00:46,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {3492#(< main_~i~0 10)} assume !!(~i~0 <= ~n~0); {3492#(< main_~i~0 10)} is VALID [2022-04-08 09:00:46,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {3366#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3492#(< main_~i~0 10)} is VALID [2022-04-08 09:00:46,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {3366#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {3366#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {3365#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3366#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:46,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {3365#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {3365#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {3364#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3365#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:46,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {3364#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {3364#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {3363#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3364#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:46,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {3363#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {3363#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3363#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:46,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {3362#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {3361#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3362#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:46,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {3361#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {3361#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {3360#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3361#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:46,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {3360#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {3360#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {3354#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; {3360#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:46,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {3354#true} call #t~ret3 := main(); {3354#true} is VALID [2022-04-08 09:00:46,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3354#true} {3354#true} #47#return; {3354#true} is VALID [2022-04-08 09:00:46,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {3354#true} assume true; {3354#true} is VALID [2022-04-08 09:00:46,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#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); {3354#true} is VALID [2022-04-08 09:00:46,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {3354#true} call ULTIMATE.init(); {3354#true} is VALID [2022-04-08 09:00:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:46,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905884743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:46,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:46,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-08 09:00:46,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:46,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883264138] [2022-04-08 09:00:46,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883264138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:46,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:46,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 09:00:46,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479033158] [2022-04-08 09:00:46,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:46,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:46,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:46,750 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-08 09:00:46,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 09:00:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 09:00:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:46,752 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:46,998 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-08 09:00:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 09:00:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-08 09:00:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2022-04-08 09:00:47,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 49 transitions. [2022-04-08 09:00:47,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:47,035 INFO L225 Difference]: With dead ends: 49 [2022-04-08 09:00:47,035 INFO L226 Difference]: Without dead ends: 41 [2022-04-08 09:00:47,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2022-04-08 09:00:47,036 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:47,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-08 09:00:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-04-08 09:00:47,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:47,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 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-08 09:00:47,115 INFO L74 IsIncluded]: Start isIncluded. First operand 41 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-08 09:00:47,115 INFO L87 Difference]: Start difference. First operand 41 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-08 09:00:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:47,116 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-08 09:00:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-08 09:00:47,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:47,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:47,117 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 41 states. [2022-04-08 09:00:47,117 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 41 states. [2022-04-08 09:00:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:47,117 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-08 09:00:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-08 09:00:47,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:47,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:47,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:47,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:47,118 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-08 09:00:47,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-04-08 09:00:47,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 35 [2022-04-08 09:00:47,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:47,119 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-04-08 09:00:47,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-08 09:00:47,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2022-04-08 09:00:47,156 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-08 09:00:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-04-08 09:00:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:00:47,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:47,156 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:47,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 09:00:47,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 09:00:47,377 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash 94178699, now seen corresponding path program 15 times [2022-04-08 09:00:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:47,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386177467] [2022-04-08 09:00:47,385 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:47,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 94178699, now seen corresponding path program 16 times [2022-04-08 09:00:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601340398] [2022-04-08 09:00:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:00:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:47,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {3869#(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); {3855#true} is VALID [2022-04-08 09:00:47,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-08 09:00:47,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3855#true} {3855#true} #47#return; {3855#true} is VALID [2022-04-08 09:00:47,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3869#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:00:47,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#(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); {3855#true} is VALID [2022-04-08 09:00:47,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-08 09:00:47,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #47#return; {3855#true} is VALID [2022-04-08 09:00:47,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret3 := main(); {3855#true} is VALID [2022-04-08 09:00:47,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#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; {3860#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:47,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {3860#(= (+ (- 1) main_~i~0) 0)} assume !!(~i~0 <= ~n~0); {3860#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:47,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#(= (+ (- 1) main_~i~0) 0)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3860#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-08 09:00:47,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {3860#(= (+ (- 1) main_~i~0) 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {3861#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {3861#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {3861#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {3862#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {3863#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {3863#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {3863#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {3864#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {3864#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {3864#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {3865#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {3865#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {3865#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {3866#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {3866#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {3867#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {3867#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {3867#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {3868#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {3868#(<= main_~i~0 9)} assume !(~i~0 < 10); {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {3856#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !(~i~0 <= ~n~0); {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L272 TraceCheckUtils]: 34: Hoare triple {3856#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-08 09:00:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:00:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601340398] [2022-04-08 09:00:47,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601340398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:00:47,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404651627] [2022-04-08 09:00:47,479 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:00:47,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:00:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:00:47,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:00:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 09:00:47,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:00:47,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:00:47,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 09:00:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:00:47,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:00:47,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2022-04-08 09:00:47,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#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); {3855#true} is VALID [2022-04-08 09:00:47,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-08 09:00:47,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #47#return; {3855#true} is VALID [2022-04-08 09:00:47,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret3 := main(); {3855#true} is VALID [2022-04-08 09:00:47,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#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; {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {3888#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {3888#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {3888#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {3861#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {3861#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {3861#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {3862#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {3863#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {3863#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {3863#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {3864#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {3864#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {3864#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {3865#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {3865#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {3865#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {3866#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {3866#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {3867#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {3867#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {3867#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {3868#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {3868#(<= main_~i~0 9)} assume !(~i~0 < 10); {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {3856#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !(~i~0 <= ~n~0); {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L272 TraceCheckUtils]: 34: Hoare triple {3856#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2022-04-08 09:00:47,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-08 09:00:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:47,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:00:47,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {3856#false} assume !false; {3856#false} is VALID [2022-04-08 09:00:47,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {3856#false} assume 0 == ~cond; {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {3856#false} ~cond := #in~cond; {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L272 TraceCheckUtils]: 34: Hoare triple {3856#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {3856#false} assume !(~i~0 <= ~n~0); {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {3856#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L290 TraceCheckUtils]: 31: Hoare triple {3868#(<= main_~i~0 9)} assume !(~i~0 < 10); {3856#false} is VALID [2022-04-08 09:00:47,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {3868#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {3867#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3868#(<= main_~i~0 9)} is VALID [2022-04-08 09:00:47,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {3867#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {3867#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {3866#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3867#(<= main_~i~0 8)} is VALID [2022-04-08 09:00:47,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3866#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {3866#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {3865#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3866#(<= main_~i~0 7)} is VALID [2022-04-08 09:00:47,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {3865#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {3865#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {3864#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3865#(<= main_~i~0 6)} is VALID [2022-04-08 09:00:47,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {3864#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {3864#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {3863#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3864#(<= main_~i~0 5)} is VALID [2022-04-08 09:00:47,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {3863#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {3863#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3863#(<= main_~i~0 4)} is VALID [2022-04-08 09:00:47,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {3862#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {3862#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {3861#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3862#(<= main_~i~0 3)} is VALID [2022-04-08 09:00:47,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {3861#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {3861#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {3888#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3861#(<= main_~i~0 2)} is VALID [2022-04-08 09:00:47,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {3888#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {3888#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {3855#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; {3888#(<= main_~i~0 1)} is VALID [2022-04-08 09:00:47,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {3855#true} call #t~ret3 := main(); {3855#true} is VALID [2022-04-08 09:00:47,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3855#true} {3855#true} #47#return; {3855#true} is VALID [2022-04-08 09:00:47,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {3855#true} assume true; {3855#true} is VALID [2022-04-08 09:00:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {3855#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); {3855#true} is VALID [2022-04-08 09:00:47,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {3855#true} call ULTIMATE.init(); {3855#true} is VALID [2022-04-08 09:00:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:00:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404651627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:00:47,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:00:47,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2022-04-08 09:00:47,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:00:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386177467] [2022-04-08 09:00:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386177467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:00:47,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:00:47,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 09:00:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135967530] [2022-04-08 09:00:47,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:00:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:47,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:00:47,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:47,789 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-08 09:00:47,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 09:00:47,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 09:00:47,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:00:47,790 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:47,998 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 09:00:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 09:00:47,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:00:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 09:00:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 09:00:48,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-08 09:00:48,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:00:48,037 INFO L225 Difference]: With dead ends: 52 [2022-04-08 09:00:48,037 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 09:00:48,038 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2022-04-08 09:00:48,038 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:00:48,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:00:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 09:00:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-08 09:00:48,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:00:48,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 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-08 09:00:48,113 INFO L74 IsIncluded]: Start isIncluded. First operand 44 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-08 09:00:48,113 INFO L87 Difference]: Start difference. First operand 44 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-08 09:00:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:48,114 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 09:00:48,114 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 09:00:48,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:48,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:48,114 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 44 states. [2022-04-08 09:00:48,114 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 44 states. [2022-04-08 09:00:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:00:48,115 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-08 09:00:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-08 09:00:48,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:00:48,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:00:48,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:00:48,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:00:48,116 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-08 09:00:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-08 09:00:48,116 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 38 [2022-04-08 09:00:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:00:48,116 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-08 09:00:48,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 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-08 09:00:48,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-08 09:00:48,151 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-08 09:00:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-08 09:00:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 09:00:48,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:00:48,152 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:00:48,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 09:00:48,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 09:00:48,353 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:00:48,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:00:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 486456110, now seen corresponding path program 17 times [2022-04-08 09:00:48,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:00:48,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734799186] [2022-04-08 09:00:48,358 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:00:48,358 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:00:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 486456110, now seen corresponding path program 18 times [2022-04-08 09:00:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:00:48,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346637036] [2022-04-08 09:00:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:00:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:00:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:00:48,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 09:00:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 09:00:48,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 09:00:48,406 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 09:00:48,407 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 09:00:48,408 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:00:48,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 09:00:48,411 INFO L719 BasicCegarLoop]: Path program histogram: [18, 6, 2, 2] [2022-04-08 09:00:48,412 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:00:48,421 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 09:00:48,422 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 09:00:48,422 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:00:48,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:00:48 BoogieIcfgContainer [2022-04-08 09:00:48,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:00:48,423 INFO L158 Benchmark]: Toolchain (without parser) took 13527.60ms. Allocated memory was 164.6MB in the beginning and 292.6MB in the end (delta: 127.9MB). Free memory was 114.2MB in the beginning and 245.0MB in the end (delta: -130.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:00:48,423 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 164.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:00:48,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.79ms. Allocated memory is still 164.6MB. Free memory was 114.0MB in the beginning and 138.1MB in the end (delta: -24.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-08 09:00:48,424 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 164.6MB. Free memory was 138.1MB in the beginning and 136.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:00:48,424 INFO L158 Benchmark]: RCFGBuilder took 338.17ms. Allocated memory is still 164.6MB. Free memory was 136.7MB in the beginning and 126.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 09:00:48,425 INFO L158 Benchmark]: TraceAbstraction took 12904.78ms. Allocated memory was 164.6MB in the beginning and 292.6MB in the end (delta: 127.9MB). Free memory was 125.8MB in the beginning and 245.0MB in the end (delta: -119.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-08 09:00:48,427 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.28ms. Allocated memory is still 164.6MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.79ms. Allocated memory is still 164.6MB. Free memory was 114.0MB in the beginning and 138.1MB in the end (delta: -24.0MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 164.6MB. Free memory was 138.1MB in the beginning and 136.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 338.17ms. Allocated memory is still 164.6MB. Free memory was 136.7MB in the beginning and 126.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12904.78ms. Allocated memory was 164.6MB in the beginning and 292.6MB in the end (delta: 127.9MB). Free memory was 125.8MB in the beginning and 245.0MB in the end (delta: -119.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND TRUE i<10 [L26] sn = sn + (2) [L24] i++ [L24] COND TRUE i<=n [L25] COND FALSE !(i<10) [L24] i++ [L24] COND FALSE !(i<=n) [L28] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 118 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 118 mSolverCounterUnsat, 155 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 489 SyntacticMatches, 13 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=13, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 15 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-08 09:00:48,470 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...