/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:35:59,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:35:59,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:35:59,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:35:59,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:35:59,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:35:59,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:35:59,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:35:59,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:35:59,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:35:59,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:35:59,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:35:59,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:35:59,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:35:59,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:35:59,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:35:59,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:35:59,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:35:59,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:35:59,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:35:59,172 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:35:59,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:35:59,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:35:59,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:35:59,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:35:59,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:35:59,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:35:59,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:35:59,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:35:59,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:35:59,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:35:59,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:35:59,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:35:59,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:35:59,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:35:59,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:35:59,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:35:59,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:35:59,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:35:59,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:35:59,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:35:59,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:35:59,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:35:59,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:35:59,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:35:59,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:35:59,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:35:59,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:35:59,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:35:59,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:35:59,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:35:59,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:35:59,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:35:59,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:35:59,196 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:35:59,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:35:59,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:35:59,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:35:59,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:35:59,197 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:35:59,197 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:35:59,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:35:59,198 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:35:59,198 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 06:35:59,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:35:59,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:35:59,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:35:59,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:35:59,413 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:35:59,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-28 06:35:59,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4010216d/8a703e1f04444647a8b65edbb6be17b7/FLAGa8bf1bb77 [2022-04-28 06:35:59,869 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:35:59,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-28 06:35:59,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4010216d/8a703e1f04444647a8b65edbb6be17b7/FLAGa8bf1bb77 [2022-04-28 06:35:59,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4010216d/8a703e1f04444647a8b65edbb6be17b7 [2022-04-28 06:35:59,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:35:59,895 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:35:59,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:35:59,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:35:59,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:35:59,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:35:59" (1/1) ... [2022-04-28 06:35:59,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:35:59, skipping insertion in model container [2022-04-28 06:35:59,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:35:59" (1/1) ... [2022-04-28 06:35:59,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:35:59,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:36:00,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2022-04-28 06:36:00,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:36:00,102 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:36:00,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2022-04-28 06:36:00,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:36:00,143 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:36:00,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00 WrapperNode [2022-04-28 06:36:00,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:36:00,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:36:00,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:36:00,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:36:00,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:36:00,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:36:00,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:36:00,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:36:00,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (1/1) ... [2022-04-28 06:36:00,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:36:00,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:00,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 06:36:00,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 06:36:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:36:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:36:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:36:00,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:36:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:36:00,245 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:36:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:36:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:36:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:36:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:36:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:36:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:36:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:36:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:36:00,296 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:36:00,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:36:00,430 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:36:00,436 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:36:00,436 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 06:36:00,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:36:00 BoogieIcfgContainer [2022-04-28 06:36:00,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:36:00,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:36:00,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:36:00,441 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:36:00,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:35:59" (1/3) ... [2022-04-28 06:36:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c270c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:36:00, skipping insertion in model container [2022-04-28 06:36:00,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:36:00" (2/3) ... [2022-04-28 06:36:00,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c270c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:36:00, skipping insertion in model container [2022-04-28 06:36:00,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:36:00" (3/3) ... [2022-04-28 06:36:00,443 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2022-04-28 06:36:00,454 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:36:00,455 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:36:00,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:36:00,511 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2dafb587, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@72976af3 [2022-04-28 06:36:00,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:36:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:36:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:36:00,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:00,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:00,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-28 06:36:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906357561] [2022-04-28 06:36:00,555 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-28 06:36:00,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:00,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493309452] [2022-04-28 06:36:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:00,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:36:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:00,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 06:36:00,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:36:00,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 06:36:00,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:36:00,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-28 06:36:00,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:36:00,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-28 06:36:00,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-28 06:36:00,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-28 06:36:00,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-28 06:36:00,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-28 06:36:00,707 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-28 06:36:00,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 06:36:00,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 06:36:00,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 06:36:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:36:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:00,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493309452] [2022-04-28 06:36:00,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493309452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:00,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:00,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:36:00,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906357561] [2022-04-28 06:36:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906357561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:00,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:00,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:36:00,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63574779] [2022-04-28 06:36:00,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:36:00,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:00,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:00,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:00,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:36:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:36:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:36:00,758 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:00,961 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-28 06:36:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:36:00,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:36:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 06:36:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-28 06:36:00,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-28 06:36:01,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:01,077 INFO L225 Difference]: With dead ends: 57 [2022-04-28 06:36:01,077 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:36:01,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:36:01,086 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:01,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:36:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 06:36:01,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:01,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,132 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,132 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:01,138 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 06:36:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 06:36:01,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:01,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:01,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 06:36:01,143 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-28 06:36:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:01,151 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-28 06:36:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-28 06:36:01,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:01,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:01,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:01,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-28 06:36:01,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-28 06:36:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:01,156 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-28 06:36:01,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-28 06:36:01,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-28 06:36:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:36:01,210 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:01,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:01,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:36:01,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-28 06:36:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:01,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467634666] [2022-04-28 06:36:01,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-28 06:36:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037451449] [2022-04-28 06:36:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:36:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:01,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 06:36:01,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 06:36:01,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 06:36:01,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:36:01,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-28 06:36:01,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 06:36:01,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-28 06:36:01,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-28 06:36:01,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:36:01,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:36:01,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 5);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-28 06:36:01,332 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:01,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:36:01,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-28 06:36:01,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 06:36:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:36:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:01,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037451449] [2022-04-28 06:36:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037451449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:01,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:01,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467634666] [2022-04-28 06:36:01,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467634666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:01,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:01,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617593428] [2022-04-28 06:36:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:01,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:36:01,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:01,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:01,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:36:01,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:36:01,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:36:01,350 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:01,714 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-28 06:36:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:36:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:36:01,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:36:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:36:01,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 06:36:01,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:01,782 INFO L225 Difference]: With dead ends: 41 [2022-04-28 06:36:01,782 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 06:36:01,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:36:01,785 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:01,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:01,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 06:36:01,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-28 06:36:01,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:01,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,800 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,800 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:01,805 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 06:36:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 06:36:01,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:01,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:01,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 06:36:01,816 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 06:36:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:01,833 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 06:36:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-28 06:36:01,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:01,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:01,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:01,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-28 06:36:01,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-28 06:36:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:01,836 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-28 06:36:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:01,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-28 06:36:01,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 06:36:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 06:36:01,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:01,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 06:36:01,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-28 06:36:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066884570] [2022-04-28 06:36:01,890 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-28 06:36:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:01,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091326967] [2022-04-28 06:36:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:36:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:01,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:36:01,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:01,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-28 06:36:01,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {502#false} is VALID [2022-04-28 06:36:01,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-28 06:36:01,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 5);havoc #t~post6; {502#false} is VALID [2022-04-28 06:36:01,984 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-28 06:36:01,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-28 06:36:01,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-28 06:36:01,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-28 06:36:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:36:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091326967] [2022-04-28 06:36:01,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091326967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:01,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:01,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:36:01,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:01,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2066884570] [2022-04-28 06:36:01,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2066884570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:01,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:01,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:36:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76068234] [2022-04-28 06:36:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 14 [2022-04-28 06:36:01,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:01,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:02,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:02,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:36:02,008 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,174 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-28 06:36:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:36:02,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 14 [2022-04-28 06:36:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 06:36:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-28 06:36:02,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-28 06:36:02,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,228 INFO L225 Difference]: With dead ends: 46 [2022-04-28 06:36:02,229 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 06:36:02,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:36:02,232 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:02,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 06:36:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 06:36:02,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:02,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,252 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,253 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,260 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 06:36:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:36:02,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:02,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:02,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 06:36:02,263 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-28 06:36:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,266 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 06:36:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:36:02,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:02,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:02,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:02,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 06:36:02,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-28 06:36:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:02,269 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 06:36:02,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:36:02,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 06:36:02,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 06:36:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 06:36:02,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:02,306 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:02,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 06:36:02,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-28 06:36:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:02,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1954952218] [2022-04-28 06:36:02,312 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-28 06:36:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:02,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124789525] [2022-04-28 06:36:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:02,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:36:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:02,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 06:36:02,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:36:02,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 06:36:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 06:36:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:02,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 06:36:02,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 06:36:02,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:36:02,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:02,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:36:02,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-28 06:36:02,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:36:02,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-28 06:36:02,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-28 06:36:02,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:02,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:02,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 5);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:02,385 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-28 06:36:02,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-28 06:36:02,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-28 06:36:02,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-28 06:36:02,386 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:02,387 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:02,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:36:02,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-28 06:36:02,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-28 06:36:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:36:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:02,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124789525] [2022-04-28 06:36:02,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124789525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:02,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:02,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:02,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:02,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1954952218] [2022-04-28 06:36:02,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1954952218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:02,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:02,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509099947] [2022-04-28 06:36:02,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 06:36:02,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:02,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:36:02,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:36:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:36:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:36:02,408 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:36:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,703 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-28 06:36:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:36:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 06:36:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:36:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:36:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:36:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-28 06:36:02,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-28 06:36:02,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,755 INFO L225 Difference]: With dead ends: 46 [2022-04-28 06:36:02,755 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 06:36:02,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:36:02,757 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:02,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 06:36:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-28 06:36:02,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:02,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,766 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,769 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 06:36:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 06:36:02,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:02,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:02,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 06:36:02,770 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-28 06:36:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:02,772 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 06:36:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 06:36:02,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:02,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:02,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:02,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:36:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 06:36:02,774 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-28 06:36:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:02,775 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 06:36:02,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:36:02,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 06:36:02,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 06:36:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 06:36:02,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:02,815 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 06:36:02,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-28 06:36:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488135299] [2022-04-28 06:36:02,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-28 06:36:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480274365] [2022-04-28 06:36:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:02,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316629563] [2022-04-28 06:36:02,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:02,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:02,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:02,839 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:02,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 06:36:02,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:02,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:02,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:36:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:02,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:03,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-28 06:36:03,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-28 06:36:03,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:36:03,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-28 06:36:03,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-28 06:36:03,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:03,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:03,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:03,166 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 06:36:03,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 06:36:03,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 06:36:03,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:36:03,167 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:03,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-28 06:36:03,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-28 06:36:03,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-28 06:36:03,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-28 06:36:03,170 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:03,171 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:03,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:03,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-28 06:36:03,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-28 06:36:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:36:03,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:36:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480274365] [2022-04-28 06:36:03,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316629563] [2022-04-28 06:36:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316629563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:03,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:03,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:03,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488135299] [2022-04-28 06:36:03,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488135299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:03,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:03,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605960954] [2022-04-28 06:36:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:03,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 06:36:03,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:03,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:36:03,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:03,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:03,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:36:03,196 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:36:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:03,373 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 06:36:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:36:03,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 06:36:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:36:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 06:36:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:36:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-28 06:36:03,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-28 06:36:03,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:03,445 INFO L225 Difference]: With dead ends: 65 [2022-04-28 06:36:03,445 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 06:36:03,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:36:03,448 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:03,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 06:36:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 06:36:03,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:03,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:03,468 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:03,468 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:03,472 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:36:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:36:03,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:03,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:03,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 06:36:03,473 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-28 06:36:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:03,477 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-28 06:36:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:36:03,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:03,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:03,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:03,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 06:36:03,482 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-28 06:36:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:03,482 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-28 06:36:03,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:36:03,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 06:36:03,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-28 06:36:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 06:36:03,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:03,538 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:03,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:03,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:03,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:03,748 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-28 06:36:03,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:03,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1916768424] [2022-04-28 06:36:03,749 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-28 06:36:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:03,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136026736] [2022-04-28 06:36:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:03,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:03,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513142061] [2022-04-28 06:36:03,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:03,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:03,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:03,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 06:36:03,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:03,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:03,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:36:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:03,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:03,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-28 06:36:03,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:03,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:03,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:03,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:04,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:04,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,003 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,005 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,006 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,007 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,009 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,012 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:04,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-28 06:36:04,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1411#false} is VALID [2022-04-28 06:36:04,023 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-28 06:36:04,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-28 06:36:04,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-28 06:36:04,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-28 06:36:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:36:04,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:36:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136026736] [2022-04-28 06:36:04,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513142061] [2022-04-28 06:36:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513142061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:04,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:04,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:04,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:04,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1916768424] [2022-04-28 06:36:04,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1916768424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:04,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:04,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77408483] [2022-04-28 06:36:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:36:04,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:04,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:04,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:36:04,046 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:04,160 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-28 06:36:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:36:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:36:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:04,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:36:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-28 06:36:04,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-28 06:36:04,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:04,209 INFO L225 Difference]: With dead ends: 70 [2022-04-28 06:36:04,209 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 06:36:04,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:36:04,210 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:04,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 06:36:04,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 06:36:04,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:04,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:04,245 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:04,246 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:04,248 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 06:36:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 06:36:04,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:04,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:04,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 06:36:04,249 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-28 06:36:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:04,251 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-28 06:36:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-28 06:36:04,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:04,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:04,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:04,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:36:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-28 06:36:04,254 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-28 06:36:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:04,254 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-28 06:36:04,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-28 06:36:04,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-28 06:36:04,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 06:36:04,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:04,320 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:04,345 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-28 06:36:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-28 06:36:04,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:04,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-28 06:36:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:04,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1205304537] [2022-04-28 06:36:04,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:36:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-28 06:36:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:04,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927169053] [2022-04-28 06:36:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:04,549 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:04,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882602950] [2022-04-28 06:36:04,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:04,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:04,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:04,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:36:04,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:04,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:04,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:36:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:04,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:04,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-28 06:36:04,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-28 06:36:04,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:36:04,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-28 06:36:04,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-28 06:36:04,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,844 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:36:04,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:36:04,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:36:04,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:36:04,844 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,845 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:36:04,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:36:04,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:36:04,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:36:04,845 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,846 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-28 06:36:04,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-28 06:36:04,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-28 06:36:04,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-28 06:36:04,846 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 06:36:04,852 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:04,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:04,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-28 06:36:04,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-28 06:36:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:36:04,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:36:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:04,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927169053] [2022-04-28 06:36:04,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:04,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882602950] [2022-04-28 06:36:04,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882602950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:04,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:04,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:04,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1205304537] [2022-04-28 06:36:04,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1205304537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:04,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225654421] [2022-04-28 06:36:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:04,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:36:04,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:04,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:04,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:04,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:36:04,880 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:05,092 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-28 06:36:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:36:05,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-28 06:36:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 06:36:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 06:36:05,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 06:36:05,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:05,144 INFO L225 Difference]: With dead ends: 76 [2022-04-28 06:36:05,144 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 06:36:05,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:36:05,146 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 06:36:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 06:36:05,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:05,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:05,195 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:05,195 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:05,199 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 06:36:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 06:36:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:05,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 06:36:05,200 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-28 06:36:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:05,202 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-28 06:36:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-28 06:36:05,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:05,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:05,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:05,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-28 06:36:05,208 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-28 06:36:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:05,208 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-28 06:36:05,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:05,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-28 06:36:05,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-28 06:36:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 06:36:05,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:05,301 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:05,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:05,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:05,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-28 06:36:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:05,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086258015] [2022-04-28 06:36:09,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:09,667 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:09,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-28 06:36:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:09,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223167959] [2022-04-28 06:36:09,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:09,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:09,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111802762] [2022-04-28 06:36:09,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:09,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:09,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:09,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:36:09,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:09,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:09,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:36:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:09,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:09,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 06:36:09,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:09,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:09,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:09,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:09,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:09,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,919 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,920 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,921 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,923 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,923 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:09,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-28 06:36:09,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {2397#false} is VALID [2022-04-28 06:36:09,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 06:36:09,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 5);havoc #t~post6; {2397#false} is VALID [2022-04-28 06:36:09,927 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 06:36:09,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 06:36:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 06:36:09,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:10,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-28 06:36:10,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-28 06:36:10,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-28 06:36:10,110 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-28 06:36:10,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-28 06:36:10,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:36:10,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:36:10,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:36:10,115 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:36:10,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 5);havoc #t~post6; {2397#false} is VALID [2022-04-28 06:36:10,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-28 06:36:10,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {2397#false} is VALID [2022-04-28 06:36:10,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 5)} is VALID [2022-04-28 06:36:10,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,117 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #82#return; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:36:10,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:36:10,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:36:10,117 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:36:10,118 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #80#return; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:36:10,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:36:10,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:36:10,118 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:36:10,119 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #78#return; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-28 06:36:10,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-28 06:36:10,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-28 06:36:10,119 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-28 06:36:10,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 5)} is VALID [2022-04-28 06:36:10,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2604#(< ~counter~0 4)} is VALID [2022-04-28 06:36:10,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 4)} call #t~ret7 := main(); {2604#(< ~counter~0 4)} is VALID [2022-04-28 06:36:10,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 4)} {2396#true} #92#return; {2604#(< ~counter~0 4)} is VALID [2022-04-28 06:36:10,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 4)} assume true; {2604#(< ~counter~0 4)} is VALID [2022-04-28 06:36:10,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2604#(< ~counter~0 4)} is VALID [2022-04-28 06:36:10,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-28 06:36:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 06:36:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:10,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223167959] [2022-04-28 06:36:10,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:10,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111802762] [2022-04-28 06:36:10,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111802762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:10,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:10,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:36:10,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:10,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2086258015] [2022-04-28 06:36:10,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2086258015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:10,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:10,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393254084] [2022-04-28 06:36:10,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:10,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 06:36:10,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:10,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:36:10,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:10,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:10,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:10,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:36:10,147 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:36:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:10,288 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-28 06:36:10,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:36:10,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-28 06:36:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:36:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 06:36:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:36:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-28 06:36:10,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-28 06:36:10,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:10,349 INFO L225 Difference]: With dead ends: 90 [2022-04-28 06:36:10,349 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 06:36:10,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:36:10,353 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:10,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 06:36:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 06:36:10,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:10,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:10,398 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:10,398 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:10,401 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 06:36:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:36:10,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:10,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:10,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 06:36:10,402 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-28 06:36:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:10,404 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-28 06:36:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:36:10,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:10,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:10,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:10,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:36:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-28 06:36:10,407 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-28 06:36:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:10,407 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-28 06:36:10,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 06:36:10,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-28 06:36:10,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-28 06:36:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 06:36:10,485 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:10,485 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:10,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:10,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:10,686 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-28 06:36:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:10,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1488594242] [2022-04-28 06:36:14,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:14,825 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:14,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-28 06:36:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:14,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252506788] [2022-04-28 06:36:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:14,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:14,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1086028726] [2022-04-28 06:36:14,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:14,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:14,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:14,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:14,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:36:14,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:14,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:14,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:36:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:14,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:15,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 06:36:15,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 06:36:15,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 06:36:15,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 06:36:15,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,099 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,100 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,100 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,106 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,106 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,107 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:15,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:36:15,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:36:15,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:36:15,132 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,136 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:36:15,136 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,137 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 06:36:15,138 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:15,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:15,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 06:36:15,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 06:36:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 06:36:15,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:15,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-28 06:36:15,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-28 06:36:15,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:15,330 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:15,331 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,332 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,332 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,333 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,350 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,350 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,351 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,352 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-28 06:36:15,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-28 06:36:15,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-28 06:36:15,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 06:36:15,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-28 06:36:15,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-28 06:36:15,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-28 06:36:15,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-28 06:36:15,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-28 06:36:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 06:36:15,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252506788] [2022-04-28 06:36:15,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:15,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086028726] [2022-04-28 06:36:15,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086028726] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 06:36:15,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 06:36:15,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 06:36:15,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:15,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1488594242] [2022-04-28 06:36:15,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1488594242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:15,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:15,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:36:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849234358] [2022-04-28 06:36:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:15,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 06:36:15,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:15,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:15,378 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-28 06:36:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:36:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:15,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:36:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 06:36:15,379 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:15,696 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-28 06:36:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:36:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-28 06:36:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 06:36:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-28 06:36:15,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-28 06:36:15,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:15,750 INFO L225 Difference]: With dead ends: 78 [2022-04-28 06:36:15,750 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 06:36:15,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:36:15,751 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:15,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:36:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 06:36:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-28 06:36:15,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:15,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:36:15,795 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:36:15,796 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:36:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:15,799 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 06:36:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 06:36:15,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:15,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:15,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 06:36:15,800 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-28 06:36:15,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:15,805 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-28 06:36:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-28 06:36:15,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:15,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:15,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:15,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:36:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-28 06:36:15,810 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-28 06:36:15,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:15,810 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-28 06:36:15,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 06:36:15,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-28 06:36:15,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-28 06:36:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 06:36:15,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:15,905 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:15,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:16,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-28 06:36:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:16,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33537639] [2022-04-28 06:36:17,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:17,256 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:17,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-28 06:36:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:17,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945538748] [2022-04-28 06:36:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:17,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545496016] [2022-04-28 06:36:17,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:17,272 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:17,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 06:36:17,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:17,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:17,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:36:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:17,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:17,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 06:36:17,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:17,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:17,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:17,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:17,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:17,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,576 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,578 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,578 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,580 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,581 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,588 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:17,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,589 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,591 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,591 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,597 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,598 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,599 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-28 06:36:17,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:36:17,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:36:17,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 06:36:17,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 06:36:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 06:36:17,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:17,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-28 06:36:17,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-28 06:36:17,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-28 06:36:17,868 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-28 06:36:17,868 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-28 06:36:17,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,869 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {3770#false} is VALID [2022-04-28 06:36:17,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 5)} is VALID [2022-04-28 06:36:17,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 5)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,877 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #82#return; {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,878 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,879 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #80#return; {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,880 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,880 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,880 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #78#return; {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,881 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 5)} is VALID [2022-04-28 06:36:17,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,883 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #82#return; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,884 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,884 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #80#return; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,884 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,885 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #78#return; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-28 06:36:17,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-28 06:36:17,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-28 06:36:17,885 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-28 06:36:17,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 4)} is VALID [2022-04-28 06:36:17,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {3848#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {3848#(<= ~counter~0 2)} call #t~ret7 := main(); {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3848#(<= ~counter~0 2)} {3769#true} #92#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3848#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:17,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-28 06:36:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 06:36:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:17,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945538748] [2022-04-28 06:36:17,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:17,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545496016] [2022-04-28 06:36:17,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545496016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:17,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:17,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 06:36:17,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:17,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33537639] [2022-04-28 06:36:17,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33537639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:17,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:17,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713503058] [2022-04-28 06:36:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:17,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 06:36:17,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:17,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:17,925 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-28 06:36:17,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:36:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:17,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:36:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:36:17,926 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:18,115 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-28 06:36:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:36:18,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-28 06:36:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 06:36:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-28 06:36:18,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-28 06:36:18,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:18,180 INFO L225 Difference]: With dead ends: 104 [2022-04-28 06:36:18,180 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 06:36:18,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:36:18,181 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:18,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 06:36:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-28 06:36:18,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:18,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:18,249 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:18,249 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:18,251 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 06:36:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 06:36:18,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:18,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 06:36:18,252 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-28 06:36:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:18,254 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-28 06:36:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-28 06:36:18,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:18,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:18,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:18,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-28 06:36:18,257 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-28 06:36:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:18,258 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-28 06:36:18,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:18,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-28 06:36:18,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-28 06:36:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 06:36:18,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:18,383 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:18,399 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-28 06:36:18,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:18,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-28 06:36:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653280390] [2022-04-28 06:36:22,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:22,704 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:22,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-28 06:36:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:22,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516107820] [2022-04-28 06:36:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:22,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:22,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938871526] [2022-04-28 06:36:22,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:36:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:22,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:22,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 06:36:22,782 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:36:22,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:22,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:36:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:22,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:23,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {4669#true} call ULTIMATE.init(); {4669#true} is VALID [2022-04-28 06:36:23,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {4669#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4677#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:23,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#(<= ~counter~0 0)} assume true; {4677#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:23,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4677#(<= ~counter~0 0)} {4669#true} #92#return; {4677#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:23,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {4677#(<= ~counter~0 0)} call #t~ret7 := main(); {4677#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:23,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {4677#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4677#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:23,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {4677#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {4693#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,025 INFO L272 TraceCheckUtils]: 8: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,027 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #78#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,027 INFO L272 TraceCheckUtils]: 13: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,029 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #80#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,029 INFO L272 TraceCheckUtils]: 18: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,031 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #82#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {4693#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4693#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:23,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {4693#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {4748#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,033 INFO L272 TraceCheckUtils]: 26: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,035 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #78#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,035 INFO L272 TraceCheckUtils]: 31: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,037 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #80#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,038 INFO L272 TraceCheckUtils]: 36: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,039 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #82#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {4748#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {4748#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4803#(<= |main_#t~post5| 2)} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {4803#(<= |main_#t~post5| 2)} assume !(#t~post5 < 5);havoc #t~post5; {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {4670#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {4670#false} assume !(#t~post6 < 5);havoc #t~post6; {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L272 TraceCheckUtils]: 46: Hoare triple {4670#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#false} assume !(0 == ~cond); {4670#false} is VALID [2022-04-28 06:36:23,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#false} assume true; {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#false} {4670#false} #88#return; {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L272 TraceCheckUtils]: 51: Hoare triple {4670#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L290 TraceCheckUtils]: 52: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {4670#false} assume 0 == ~cond; {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {4670#false} assume !false; {4670#false} is VALID [2022-04-28 06:36:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 06:36:23,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:23,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {4670#false} assume !false; {4670#false} is VALID [2022-04-28 06:36:23,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {4670#false} assume 0 == ~cond; {4670#false} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-28 06:36:23,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {4670#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4670#false} is VALID [2022-04-28 06:36:23,281 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4669#true} {4670#false} #88#return; {4670#false} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,281 INFO L272 TraceCheckUtils]: 46: Hoare triple {4670#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {4670#false} assume !(#t~post6 < 5);havoc #t~post6; {4670#false} is VALID [2022-04-28 06:36:23,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {4670#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4670#false} is VALID [2022-04-28 06:36:23,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {4873#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {4670#false} is VALID [2022-04-28 06:36:23,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {4877#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4873#(< |main_#t~post5| 5)} is VALID [2022-04-28 06:36:23,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {4877#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,283 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #82#return; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,284 INFO L272 TraceCheckUtils]: 36: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,284 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #80#return; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,284 INFO L272 TraceCheckUtils]: 31: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,285 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #78#return; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,285 INFO L272 TraceCheckUtils]: 26: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {4877#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {4932#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4877#(< ~counter~0 5)} is VALID [2022-04-28 06:36:23,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {4932#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,290 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #82#return; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,290 INFO L272 TraceCheckUtils]: 18: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,290 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #80#return; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,291 INFO L272 TraceCheckUtils]: 13: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,291 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #78#return; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-28 06:36:23,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-28 06:36:23,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-28 06:36:23,292 INFO L272 TraceCheckUtils]: 8: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4669#true} is VALID [2022-04-28 06:36:23,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {4932#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4748#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4932#(< ~counter~0 4)} is VALID [2022-04-28 06:36:23,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4748#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {4748#(<= ~counter~0 2)} call #t~ret7 := main(); {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4748#(<= ~counter~0 2)} {4669#true} #92#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {4669#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4748#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:23,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {4669#true} call ULTIMATE.init(); {4669#true} is VALID [2022-04-28 06:36:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 06:36:23,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516107820] [2022-04-28 06:36:23,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938871526] [2022-04-28 06:36:23,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938871526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:23,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:23,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 06:36:23,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:23,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653280390] [2022-04-28 06:36:23,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653280390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:23,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:23,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:36:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394488115] [2022-04-28 06:36:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 06:36:23,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:23,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:23,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:23,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:36:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:36:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:36:23,329 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:23,512 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-28 06:36:23,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:36:23,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-28 06:36:23,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 06:36:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-28 06:36:23,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-28 06:36:23,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:23,573 INFO L225 Difference]: With dead ends: 126 [2022-04-28 06:36:23,573 INFO L226 Difference]: Without dead ends: 93 [2022-04-28 06:36:23,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:36:23,574 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:23,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-28 06:36:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-28 06:36:23,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:23,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:23,641 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:23,642 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:23,645 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 06:36:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:36:23,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:23,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:23,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 06:36:23,646 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-28 06:36:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:23,648 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-28 06:36:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:36:23,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:23,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:23,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:23,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:36:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-28 06:36:23,651 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-28 06:36:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:23,651 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-28 06:36:23,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-28 06:36:23,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-28 06:36:23,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-28 06:36:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 06:36:23,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:23,749 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:23,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:23,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-28 06:36:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:23,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065639520] [2022-04-28 06:36:26,069 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:26,069 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:26,069 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-28 06:36:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:26,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379453237] [2022-04-28 06:36:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:26,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:26,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939325116] [2022-04-28 06:36:26,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:26,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:26,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 06:36:26,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:26,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:26,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 06:36:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:26,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:26,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {5635#true} call ULTIMATE.init(); {5635#true} is VALID [2022-04-28 06:36:26,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5635#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5643#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:26,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {5643#(<= ~counter~0 0)} assume true; {5643#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:26,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5643#(<= ~counter~0 0)} {5635#true} #92#return; {5643#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:26,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {5643#(<= ~counter~0 0)} call #t~ret7 := main(); {5643#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:26,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {5643#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5643#(<= ~counter~0 0)} is VALID [2022-04-28 06:36:26,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {5643#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {5659#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,451 INFO L272 TraceCheckUtils]: 8: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,452 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #78#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,453 INFO L272 TraceCheckUtils]: 13: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,454 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #80#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,455 INFO L272 TraceCheckUtils]: 18: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,456 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #82#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {5659#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {5659#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {5714#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,458 INFO L272 TraceCheckUtils]: 26: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,458 INFO L290 TraceCheckUtils]: 28: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,459 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #78#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,460 INFO L272 TraceCheckUtils]: 31: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,461 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #80#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,462 INFO L272 TraceCheckUtils]: 36: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,463 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #82#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {5714#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {5769#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,465 INFO L272 TraceCheckUtils]: 44: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {5769#(<= ~counter~0 3)} ~cond := #in~cond; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {5769#(<= ~counter~0 3)} assume !(0 == ~cond); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {5769#(<= ~counter~0 3)} assume true; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,466 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5769#(<= ~counter~0 3)} {5769#(<= ~counter~0 3)} #84#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,467 INFO L272 TraceCheckUtils]: 49: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {5769#(<= ~counter~0 3)} ~cond := #in~cond; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {5769#(<= ~counter~0 3)} assume !(0 == ~cond); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {5769#(<= ~counter~0 3)} assume true; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,469 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5769#(<= ~counter~0 3)} {5769#(<= ~counter~0 3)} #86#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {5769#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {5769#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {5769#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5812#(<= |main_#t~post6| 3)} is VALID [2022-04-28 06:36:26,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {5812#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {5636#false} is VALID [2022-04-28 06:36:26,471 INFO L272 TraceCheckUtils]: 58: Hoare triple {5636#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5636#false} is VALID [2022-04-28 06:36:26,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {5636#false} ~cond := #in~cond; {5636#false} is VALID [2022-04-28 06:36:26,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#false} assume 0 == ~cond; {5636#false} is VALID [2022-04-28 06:36:26,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {5636#false} assume !false; {5636#false} is VALID [2022-04-28 06:36:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 06:36:26,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:26,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {5636#false} assume !false; {5636#false} is VALID [2022-04-28 06:36:26,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#false} assume 0 == ~cond; {5636#false} is VALID [2022-04-28 06:36:26,732 INFO L290 TraceCheckUtils]: 59: Hoare triple {5636#false} ~cond := #in~cond; {5636#false} is VALID [2022-04-28 06:36:26,732 INFO L272 TraceCheckUtils]: 58: Hoare triple {5636#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5636#false} is VALID [2022-04-28 06:36:26,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {5840#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {5636#false} is VALID [2022-04-28 06:36:26,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {5844#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5840#(< |main_#t~post6| 5)} is VALID [2022-04-28 06:36:26,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {5844#(< ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {5844#(< ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,737 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5635#true} {5844#(< ~counter~0 5)} #86#return; {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,737 INFO L272 TraceCheckUtils]: 49: Hoare triple {5844#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,738 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5635#true} {5844#(< ~counter~0 5)} #84#return; {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,738 INFO L272 TraceCheckUtils]: 44: Hoare triple {5844#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {5844#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {5769#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5844#(< ~counter~0 5)} is VALID [2022-04-28 06:36:26,740 INFO L290 TraceCheckUtils]: 41: Hoare triple {5769#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,740 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #82#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,741 INFO L272 TraceCheckUtils]: 36: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,742 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #80#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,742 INFO L272 TraceCheckUtils]: 31: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,742 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #78#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,743 INFO L272 TraceCheckUtils]: 26: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {5769#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {5714#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5769#(<= ~counter~0 3)} is VALID [2022-04-28 06:36:26,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {5714#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,745 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #82#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,745 INFO L272 TraceCheckUtils]: 18: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,745 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #80#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L272 TraceCheckUtils]: 13: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #78#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-28 06:36:26,746 INFO L272 TraceCheckUtils]: 8: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5635#true} is VALID [2022-04-28 06:36:26,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {5714#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {5659#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-28 06:36:26,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {5659#(<= ~counter~0 1)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {5659#(<= ~counter~0 1)} call #t~ret7 := main(); {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5659#(<= ~counter~0 1)} {5635#true} #92#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {5635#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5659#(<= ~counter~0 1)} is VALID [2022-04-28 06:36:26,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {5635#true} call ULTIMATE.init(); {5635#true} is VALID [2022-04-28 06:36:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:36:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:26,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379453237] [2022-04-28 06:36:26,749 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:26,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939325116] [2022-04-28 06:36:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939325116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:26,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:26,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 06:36:26,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065639520] [2022-04-28 06:36:26,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065639520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:26,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:26,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:36:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741695611] [2022-04-28 06:36:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 06:36:26,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:26,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:36:26,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:26,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:36:26,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:36:26,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:36:26,787 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:36:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:27,083 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-28 06:36:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:36:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-28 06:36:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:36:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 06:36:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:36:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 06:36:27,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 06:36:27,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:27,169 INFO L225 Difference]: With dead ends: 145 [2022-04-28 06:36:27,169 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 06:36:27,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:36:27,171 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:27,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 173 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:36:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 06:36:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 06:36:27,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:27,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:36:27,275 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:36:27,276 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:36:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:27,278 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 06:36:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 06:36:27,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:27,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:27,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 06:36:27,280 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-28 06:36:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:27,283 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-28 06:36:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-28 06:36:27,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:27,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:27,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:27,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 06:36:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-28 06:36:27,286 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-28 06:36:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:27,287 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-28 06:36:27,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 06:36:27,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-28 06:36:27,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-28 06:36:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 06:36:27,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:27,494 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:27,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 06:36:27,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 06:36:27,695 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:27,695 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-28 06:36:27,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:27,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226969159] [2022-04-28 06:36:29,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:29,982 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:29,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:29,982 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-28 06:36:29,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:29,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034407245] [2022-04-28 06:36:29,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:29,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:30,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:30,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007236399] [2022-04-28 06:36:30,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:36:30,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:30,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:30,001 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:36:30,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 06:36:30,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:36:30,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:30,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 06:36:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:30,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:30,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-28 06:36:30,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6821#true} is VALID [2022-04-28 06:36:30,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #92#return; {6821#true} is VALID [2022-04-28 06:36:30,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret7 := main(); {6821#true} is VALID [2022-04-28 06:36:30,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,528 INFO L272 TraceCheckUtils]: 8: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,529 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,529 INFO L272 TraceCheckUtils]: 13: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,530 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,530 INFO L272 TraceCheckUtils]: 18: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,531 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,533 INFO L272 TraceCheckUtils]: 26: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,534 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,534 INFO L272 TraceCheckUtils]: 31: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,535 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,535 INFO L272 TraceCheckUtils]: 36: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,536 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,538 INFO L272 TraceCheckUtils]: 44: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,539 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,539 INFO L272 TraceCheckUtils]: 49: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:30,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:30,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:30,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:30,540 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 06:36:30,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 06:36:30,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:36:30,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:36:30,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 06:36:30,552 INFO L272 TraceCheckUtils]: 58: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:30,553 INFO L290 TraceCheckUtils]: 59: Hoare triple {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:30,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {7007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6822#false} is VALID [2022-04-28 06:36:30,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-28 06:36:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:36:30,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:36:31,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-28 06:36:31,750 INFO L290 TraceCheckUtils]: 60: Hoare triple {7007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6822#false} is VALID [2022-04-28 06:36:31,750 INFO L290 TraceCheckUtils]: 59: Hoare triple {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:31,751 INFO L272 TraceCheckUtils]: 58: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:31,751 INFO L290 TraceCheckUtils]: 57: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 5);havoc #t~post6; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:36:31,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:36:31,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 06:36:31,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,807 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,808 INFO L290 TraceCheckUtils]: 52: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,808 INFO L290 TraceCheckUtils]: 51: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,808 INFO L272 TraceCheckUtils]: 49: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,809 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,809 INFO L290 TraceCheckUtils]: 47: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,809 INFO L290 TraceCheckUtils]: 46: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,809 INFO L290 TraceCheckUtils]: 45: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,809 INFO L272 TraceCheckUtils]: 44: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 5);havoc #t~post6; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,813 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,814 INFO L272 TraceCheckUtils]: 36: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,814 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,815 INFO L272 TraceCheckUtils]: 31: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,815 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,816 INFO L272 TraceCheckUtils]: 26: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 5);havoc #t~post5; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 06:36:31,827 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,827 INFO L272 TraceCheckUtils]: 18: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,828 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,828 INFO L272 TraceCheckUtils]: 13: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,829 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-28 06:36:31,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-28 06:36:31,829 INFO L272 TraceCheckUtils]: 8: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-28 06:36:31,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 06:36:31,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret7 := main(); {6821#true} is VALID [2022-04-28 06:36:31,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #92#return; {6821#true} is VALID [2022-04-28 06:36:31,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-28 06:36:31,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6821#true} is VALID [2022-04-28 06:36:31,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-28 06:36:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 06:36:31,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:36:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034407245] [2022-04-28 06:36:31,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:36:31,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007236399] [2022-04-28 06:36:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007236399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:36:31,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:36:31,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 06:36:31,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:36:31,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226969159] [2022-04-28 06:36:31,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226969159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:36:31,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:36:31,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:36:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526597638] [2022-04-28 06:36:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:36:31,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 06:36:31,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:36:31,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:36:31,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:31,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:36:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:36:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:36:31,876 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:36:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:32,533 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-28 06:36:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 06:36:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-28 06:36:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:36:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:36:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 06:36:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:36:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-28 06:36:32,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-28 06:36:32,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:32,650 INFO L225 Difference]: With dead ends: 181 [2022-04-28 06:36:32,650 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 06:36:32,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:36:32,651 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:36:32,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:36:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 06:36:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-28 06:36:32,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:36:32,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:36:32,745 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:36:32,746 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:36:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:32,749 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 06:36:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 06:36:32,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:32,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:32,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 06:36:32,750 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-28 06:36:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:36:32,753 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-28 06:36:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-28 06:36:32,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:36:32,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:36:32,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:36:32,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:36:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 06:36:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-28 06:36:32,758 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-28 06:36:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:36:32,758 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-28 06:36:32,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 06:36:32,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-28 06:36:32,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:36:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-28 06:36:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 06:36:32,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:36:32,903 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:36:32,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 06:36:33,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 06:36:33,103 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:36:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:36:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-28 06:36:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:36:33,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172189221] [2022-04-28 06:36:37,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:36:37,204 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-28 06:36:37,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:36:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-28 06:36:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:36:37,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699222487] [2022-04-28 06:36:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:36:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:36:37,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:36:37,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951164817] [2022-04-28 06:36:37,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:36:37,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:36:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:36:37,224 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-28 06:36:37,235 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-28 06:36:37,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:36:37,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:36:37,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:36:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:36:37,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:36:43,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {8110#true} call ULTIMATE.init(); {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {8110#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8110#true} {8110#true} #92#return; {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {8110#true} call #t~ret7 := main(); {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {8110#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {8110#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8110#true} is VALID [2022-04-28 06:36:43,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {8110#true} assume !!(#t~post5 < 5);havoc #t~post5; {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L272 TraceCheckUtils]: 8: Hoare triple {8110#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8110#true} {8110#true} #78#return; {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L272 TraceCheckUtils]: 13: Hoare triple {8110#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:43,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,488 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8110#true} #80#return; {8168#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:43,488 INFO L272 TraceCheckUtils]: 18: Hoare triple {8168#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-28 06:36:43,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-28 06:36:43,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,489 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8110#true} {8168#(= main_~A~0 main_~r~0)} #82#return; {8168#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 06:36:43,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {8168#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,491 INFO L272 TraceCheckUtils]: 26: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:43,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,492 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,492 INFO L272 TraceCheckUtils]: 31: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8110#true} {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,493 INFO L272 TraceCheckUtils]: 36: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-28 06:36:43,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,494 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8110#true} {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,495 INFO L272 TraceCheckUtils]: 44: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-28 06:36:43,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-28 06:36:43,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-28 06:36:43,496 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8110#true} {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,496 INFO L272 TraceCheckUtils]: 49: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,496 INFO L290 TraceCheckUtils]: 50: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:43,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,498 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #86#return; {8280#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 06:36:43,502 INFO L290 TraceCheckUtils]: 54: Hoare triple {8280#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8284#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)) (= main_~q~0 0) (<= (* main_~B~0 main_~p~0) main_~r~0))} is VALID [2022-04-28 06:36:43,502 INFO L290 TraceCheckUtils]: 55: Hoare triple {8284#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)) (= main_~q~0 0) (<= (* main_~B~0 main_~p~0) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:36:43,503 INFO L290 TraceCheckUtils]: 56: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:36:43,503 INFO L290 TraceCheckUtils]: 57: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 06:36:43,504 INFO L272 TraceCheckUtils]: 58: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8110#true} is VALID [2022-04-28 06:36:43,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:43,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:36:43,506 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8310#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< 0 (* main_~B~0 main_~p~0)))} is VALID [2022-04-28 06:36:43,507 INFO L272 TraceCheckUtils]: 63: Hoare triple {8310#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< 0 (* main_~B~0 main_~p~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8314#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:36:43,507 INFO L290 TraceCheckUtils]: 64: Hoare triple {8314#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8318#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:36:43,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {8318#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8111#false} is VALID [2022-04-28 06:36:43,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {8111#false} assume !false; {8111#false} is VALID [2022-04-28 06:36:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 06:36:43,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:37:04,795 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful