/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/cohendiv-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:48:36,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:48:36,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:48:36,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:48:36,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:48:36,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:48:36,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:48:36,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:48:36,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:48:36,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:48:36,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:48:36,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:48:36,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:48:36,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:48:36,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:48:36,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:48:36,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:48:36,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:48:36,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:48:36,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:48:36,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:48:36,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:48:36,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:48:36,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:48:36,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:48:36,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:48:36,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:48:36,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:48:36,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:48:36,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:48:36,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:48:36,634 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:48:36,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:48:36,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:48:36,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:48:36,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:48:36,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:48:36,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:48:36,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:48:36,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:48:36,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:48:36,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:48:36,645 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 04:48:36,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:48:36,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:48:36,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:48:36,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:48:36,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:48:36,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:48:36,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:48:36,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:48:36,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:48:36,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:48:36,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:48:36,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:48:36,660 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:48:36,661 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 04:48:36,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:48:36,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:48:36,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:48:36,890 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:48:36,891 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:48:36,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-28 04:48:36,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80bf2c4/5a313b7e140045cfb47a9454426a4922/FLAG0caf08ebf [2022-04-28 04:48:37,308 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:48:37,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-28 04:48:37,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80bf2c4/5a313b7e140045cfb47a9454426a4922/FLAG0caf08ebf [2022-04-28 04:48:37,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80bf2c4/5a313b7e140045cfb47a9454426a4922 [2022-04-28 04:48:37,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:48:37,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:48:37,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:48:37,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:48:37,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:48:37,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724c4a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37, skipping insertion in model container [2022-04-28 04:48:37,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:48:37,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:48:37,504 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/cohendiv-ll_valuebound2.c[576,589] [2022-04-28 04:48:37,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:48:37,539 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:48:37,549 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/cohendiv-ll_valuebound2.c[576,589] [2022-04-28 04:48:37,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:48:37,566 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:48:37,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37 WrapperNode [2022-04-28 04:48:37,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:48:37,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:48:37,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:48:37,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:48:37,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:48:37,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:48:37,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:48:37,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:48:37,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (1/1) ... [2022-04-28 04:48:37,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:48:37,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:37,616 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 04:48:37,633 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 04:48:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:48:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:48:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:48:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:48:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:48:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:48:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:48:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:48:37,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:48:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:48:37,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:48:37,710 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:48:37,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:48:37,925 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:48:37,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:48:37,937 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:48:37,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:48:37 BoogieIcfgContainer [2022-04-28 04:48:37,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:48:37,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:48:37,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:48:37,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:48:37,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:48:37" (1/3) ... [2022-04-28 04:48:37,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d597cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:48:37, skipping insertion in model container [2022-04-28 04:48:37,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:48:37" (2/3) ... [2022-04-28 04:48:37,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d597cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:48:37, skipping insertion in model container [2022-04-28 04:48:37,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:48:37" (3/3) ... [2022-04-28 04:48:37,951 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.c [2022-04-28 04:48:37,965 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:48:37,965 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:48:38,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:48:38,008 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@41f21a05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b04c400 [2022-04-28 04:48:38,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:48:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:48:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:48:38,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:38,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:48:38,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:38,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 1 times [2022-04-28 04:48:38,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:38,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418014142] [2022-04-28 04:48:38,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 2 times [2022-04-28 04:48:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122392766] [2022-04-28 04:48:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:48:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 04:48:38,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:48:38,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 04:48:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:48:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 04:48:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 04:48:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 04:48:38,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 04:48:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 04:48:38,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:48:38,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 04:48:38,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:48:38,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 04:48:38,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret6 := main(); {42#true} is VALID [2022-04-28 04:48:38,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-28 04:48:38,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {42#true} is VALID [2022-04-28 04:48:38,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 04:48:38,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#false} is VALID [2022-04-28 04:48:38,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {42#true} is VALID [2022-04-28 04:48:38,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,313 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 04:48:38,313 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-28 04:48:38,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:48:38,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:48:38,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:48:38,315 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 04:48:38,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {43#false} is VALID [2022-04-28 04:48:38,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#false} assume false; {43#false} is VALID [2022-04-28 04:48:38,317 INFO L272 TraceCheckUtils]: 24: Hoare triple {43#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {43#false} is VALID [2022-04-28 04:48:38,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 04:48:38,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 04:48:38,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 04:48:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:48:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:38,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122392766] [2022-04-28 04:48:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122392766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:38,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:38,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:48:38,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418014142] [2022-04-28 04:48:38,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418014142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:38,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:38,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:48:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351810323] [2022-04-28 04:48:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 28 [2022-04-28 04:48:38,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:38,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 04:48:38,373 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 04:48:38,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:48:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:38,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:48:38,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:48:38,400 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 04:48:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:38,593 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-28 04:48:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:48:38,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 28 [2022-04-28 04:48:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 04:48:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 04:48:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 04:48:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 04:48:38,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-28 04:48:38,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:38,738 INFO L225 Difference]: With dead ends: 71 [2022-04-28 04:48:38,738 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 04:48:38,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 04:48:38,743 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:38,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:48:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 04:48:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 04:48:38,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:38,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:48:38,772 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:48:38,773 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:48:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:38,777 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 04:48:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 04:48:38,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:38,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:38,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 04:48:38,779 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-28 04:48:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:38,782 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 04:48:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 04:48:38,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:38,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:38,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:38,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:48:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 04:48:38,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-28 04:48:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:38,788 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 04:48:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 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 04:48:38,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 04:48:38,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 04:48:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 04:48:38,837 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:38,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:48:38,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:48:38,837 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:38,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:38,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 1 times [2022-04-28 04:48:38,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:38,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35960527] [2022-04-28 04:48:38,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 2 times [2022-04-28 04:48:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:38,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171562653] [2022-04-28 04:48:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:38,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:38,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922769735] [2022-04-28 04:48:38,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:38,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:38,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:38,866 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 04:48:38,879 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 04:48:38,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:48:38,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:38,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:48:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:38,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:42,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-28 04:48:42,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(14, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-28 04:48:42,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:48:42,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #98#return; {340#true} is VALID [2022-04-28 04:48:42,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2022-04-28 04:48:42,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {340#true} is VALID [2022-04-28 04:48:42,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {340#true} is VALID [2022-04-28 04:48:42,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 04:48:42,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 04:48:42,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:48:42,533 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#true} {340#true} #78#return; {340#true} is VALID [2022-04-28 04:48:42,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {340#true} is VALID [2022-04-28 04:48:42,534 INFO L272 TraceCheckUtils]: 12: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {340#true} is VALID [2022-04-28 04:48:42,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 04:48:42,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 04:48:42,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:48:42,534 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {340#true} {340#true} #80#return; {340#true} is VALID [2022-04-28 04:48:42,535 INFO L272 TraceCheckUtils]: 17: Hoare triple {340#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {340#true} is VALID [2022-04-28 04:48:42,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 04:48:42,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 04:48:42,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 04:48:42,535 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {340#true} {340#true} #82#return; {340#true} is VALID [2022-04-28 04:48:42,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {340#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 04:48:42,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {411#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-28 04:48:42,538 INFO L272 TraceCheckUtils]: 24: Hoare triple {411#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:42,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:42,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-28 04:48:42,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 04:48:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 04:48:42,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:48:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171562653] [2022-04-28 04:48:42,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922769735] [2022-04-28 04:48:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922769735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:42,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:42,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:48:42,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:42,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35960527] [2022-04-28 04:48:42,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35960527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:42,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:42,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:48:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834208663] [2022-04-28 04:48:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:42,543 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), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 04:48:42,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:42,543 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:48:42,586 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 04:48:42,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:48:42,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:48:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:48:42,588 INFO L87 Difference]: Start difference. First operand 34 states and 43 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:48:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:42,793 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 04:48:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:48:42,794 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), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 04:48:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:42,795 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:48:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 04:48:42,797 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:48:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 04:48:42,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 04:48:42,855 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 04:48:42,861 INFO L225 Difference]: With dead ends: 45 [2022-04-28 04:48:42,861 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 04:48:42,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 04:48:42,866 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:42,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 149 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:48:42,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 04:48:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 04:48:42,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:42,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:48:42,916 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:48:42,918 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:48:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:42,947 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 04:48:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 04:48:42,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:42,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:42,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-28 04:48:42,949 INFO L87 Difference]: Start difference. First operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 43 states. [2022-04-28 04:48:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:42,963 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 04:48:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 04:48:42,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:42,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:42,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:42,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:48:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 04:48:42,968 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-28 04:48:42,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:42,968 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 04:48:42,968 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), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 04:48:42,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 04:48:43,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 04:48:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:48:43,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:43,023 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 04:48:43,047 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 04:48:43,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:43,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 1 times [2022-04-28 04:48:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230732140] [2022-04-28 04:48:43,245 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 2 times [2022-04-28 04:48:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077037481] [2022-04-28 04:48:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:43,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:43,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:43,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283762211] [2022-04-28 04:48:43,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:43,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:43,266 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 04:48:43,294 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 04:48:43,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:48:43,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:43,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 04:48:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:43,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:43,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {686#true} call ULTIMATE.init(); {686#true} is VALID [2022-04-28 04:48:43,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#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(14, 2);call #Ultimate.allocInit(12, 3); {686#true} is VALID [2022-04-28 04:48:43,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 04:48:43,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {686#true} {686#true} #98#return; {686#true} is VALID [2022-04-28 04:48:43,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {686#true} call #t~ret6 := main(); {686#true} is VALID [2022-04-28 04:48:43,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {686#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {686#true} is VALID [2022-04-28 04:48:43,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {686#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {686#true} is VALID [2022-04-28 04:48:43,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 04:48:43,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 04:48:43,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 04:48:43,620 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {686#true} {686#true} #78#return; {686#true} is VALID [2022-04-28 04:48:43,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {686#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {686#true} is VALID [2022-04-28 04:48:43,620 INFO L272 TraceCheckUtils]: 12: Hoare triple {686#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {686#true} is VALID [2022-04-28 04:48:43,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:48:43,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:43,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:43,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {686#true} #80#return; {741#(and (<= 0 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 04:48:43,622 INFO L272 TraceCheckUtils]: 17: Hoare triple {741#(and (<= 0 main_~y~0) (<= main_~y~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {686#true} is VALID [2022-04-28 04:48:43,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {686#true} ~cond := #in~cond; {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:48:43,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {730#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:43,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {734#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {734#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:43,625 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {734#(not (= |assume_abort_if_not_#in~cond| 0))} {741#(and (<= 0 main_~y~0) (<= main_~y~0 2))} #82#return; {757#(and (<= main_~y~0 2) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:43,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#(and (<= main_~y~0 2) (<= 1 main_~y~0))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:43,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} assume !false; {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:43,626 INFO L272 TraceCheckUtils]: 24: Hoare triple {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {686#true} is VALID [2022-04-28 04:48:43,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 04:48:43,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 04:48:43,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 04:48:43,627 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {686#true} {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} #84#return; {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:43,628 INFO L272 TraceCheckUtils]: 29: Hoare triple {761#(and (= main_~x~0 main_~r~0) (<= main_~y~0 2) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:43,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:43,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {687#false} is VALID [2022-04-28 04:48:43,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#false} assume !false; {687#false} is VALID [2022-04-28 04:48:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 04:48:43,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:48:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:43,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077037481] [2022-04-28 04:48:43,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:43,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283762211] [2022-04-28 04:48:43,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283762211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:43,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:43,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:48:43,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:43,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230732140] [2022-04-28 04:48:43,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230732140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:43,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:43,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:48:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395549344] [2022-04-28 04:48:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-28 04:48:43,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:43,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:48:43,658 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 04:48:43,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:48:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:43,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:48:43,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:48:43,659 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:48:44,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:44,145 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-28 04:48:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:48:44,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2022-04-28 04:48:44,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:48:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 04:48:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:48:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 04:48:44,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 04:48:44,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:44,225 INFO L225 Difference]: With dead ends: 57 [2022-04-28 04:48:44,225 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 04:48:44,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:48:44,227 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:44,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:48:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 04:48:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 04:48:44,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:44,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:44,269 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:44,270 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:44,273 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 04:48:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 04:48:44,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:44,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:44,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-28 04:48:44,275 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 54 states. [2022-04-28 04:48:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:44,278 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 04:48:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 04:48:44,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:44,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:44,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:44,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 04:48:44,282 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-28 04:48:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:44,282 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-28 04:48:44,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:48:44,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 04:48:44,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 04:48:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 04:48:44,357 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:44,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 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 04:48:44,386 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 04:48:44,586 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,SelfDestructingSolverStorable2 [2022-04-28 04:48:44,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:44,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 1 times [2022-04-28 04:48:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:44,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285540051] [2022-04-28 04:48:44,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 2 times [2022-04-28 04:48:44,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:44,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332001118] [2022-04-28 04:48:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:44,605 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:44,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424338716] [2022-04-28 04:48:44,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:44,606 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 04:48:44,622 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 04:48:44,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:48:44,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:44,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 04:48:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:44,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:45,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-28 04:48:45,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:45,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:48:45,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:45,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:45,855 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1125#true} #78#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,856 INFO L272 TraceCheckUtils]: 12: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:45,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:45,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:45,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:45,857 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #80#return; {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,857 INFO L272 TraceCheckUtils]: 17: Hoare triple {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:45,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:48:45,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {1151#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:45,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1155#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:45,860 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1155#(not (= |assume_abort_if_not_#in~cond| 0))} {1162#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #82#return; {1196#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(and (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} assume !false; {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,861 INFO L272 TraceCheckUtils]: 24: Hoare triple {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:45,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:45,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:45,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:45,862 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} #84#return; {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:48:45,862 INFO L272 TraceCheckUtils]: 29: Hoare triple {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:45,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1225#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:45,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {1225#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:45,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {1229#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:45,865 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1229#(not (= |__VERIFIER_assert_#in~cond| 0))} {1200#(and (<= main_~r~0 main_~x~0) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2))} #86#return; {1236#(and (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~r~0) 2) (<= 0 (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= 0 (* main_~q~0 main_~y~0)))) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:45,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {1236#(and (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~r~0) 2) (<= 0 (+ (* main_~q~0 main_~y~0) main_~r~0)) (<= 0 (* main_~q~0 main_~y~0)))) (<= 1 main_~y~0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1240#(and (= main_~a~0 1) (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~y~0) 2) (<= 0 (* main_~q~0 main_~y~0)))) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:45,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {1240#(and (= main_~a~0 1) (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~y~0) 2) (<= 0 (* main_~q~0 main_~y~0)))) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} assume !false; {1240#(and (= main_~a~0 1) (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~y~0) 2) (<= 0 (* main_~q~0 main_~y~0)))) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} is VALID [2022-04-28 04:48:45,867 INFO L272 TraceCheckUtils]: 36: Hoare triple {1240#(and (= main_~a~0 1) (exists ((main_~q~0 Int)) (and (<= (+ (* main_~q~0 main_~y~0) main_~y~0) 2) (<= 0 (* main_~q~0 main_~y~0)))) (= main_~b~0 main_~y~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:45,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {1247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:45,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {1251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 04:48:45,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 04:48:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 04:48:45,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:48:50,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 04:48:50,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {1251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 04:48:50,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {1247#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1251#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:50,236 INFO L272 TraceCheckUtils]: 36: Hoare triple {1267#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1247#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:50,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {1267#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !false; {1267#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:48:50,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {1125#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1267#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:48:50,237 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1125#true} #86#return; {1125#true} is VALID [2022-04-28 04:48:50,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:50,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L272 TraceCheckUtils]: 29: Hoare triple {1125#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1125#true} #84#return; {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L272 TraceCheckUtils]: 24: Hoare triple {1125#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:50,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !false; {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {1125#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1125#true} #82#return; {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L272 TraceCheckUtils]: 17: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:50,239 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {1125#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1125#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1125#true} is VALID [2022-04-28 04:48:50,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1125#true} {1125#true} #78#return; {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {1125#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {1125#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 04:48:50,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 04:48:50,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 04:48:50,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {1125#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(14, 2);call #Ultimate.allocInit(12, 3); {1125#true} is VALID [2022-04-28 04:48:50,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 04:48:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 04:48:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332001118] [2022-04-28 04:48:50,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424338716] [2022-04-28 04:48:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424338716] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 04:48:50,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:48:50,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 14 [2022-04-28 04:48:50,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:50,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285540051] [2022-04-28 04:48:50,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285540051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:50,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:50,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:48:50,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855433530] [2022-04-28 04:48:50,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:50,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-28 04:48:50,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:50,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 04:48:50,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:50,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:48:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:48:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:48:50,268 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 04:48:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:50,499 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-28 04:48:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:48:50,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2022-04-28 04:48:50,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 04:48:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 04:48:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 04:48:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 04:48:50,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 04:48:50,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:50,543 INFO L225 Difference]: With dead ends: 59 [2022-04-28 04:48:50,543 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 04:48:50,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:48:50,546 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:50,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:48:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 04:48:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 04:48:50,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:50,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:50,607 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:50,608 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:50,611 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 04:48:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 04:48:50,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:50,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:50,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-28 04:48:50,612 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 57 states. [2022-04-28 04:48:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:50,615 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 04:48:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 04:48:50,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:50,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:50,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:50,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-28 04:48:50,619 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-28 04:48:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:50,619 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-28 04:48:50,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-28 04:48:50,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-28 04:48:50,696 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 04:48:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 04:48:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:48:50,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:50,698 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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 04:48:50,720 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 04:48:50,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:50,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 1 times [2022-04-28 04:48:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:50,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702000897] [2022-04-28 04:48:50,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 2 times [2022-04-28 04:48:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:50,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113875826] [2022-04-28 04:48:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:50,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [168343343] [2022-04-28 04:48:50,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:50,949 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 04:48:50,954 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 04:48:50,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:48:50,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:50,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:48:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:51,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:51,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {1726#true} call ULTIMATE.init(); {1726#true} is VALID [2022-04-28 04:48:51,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1726#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(14, 2);call #Ultimate.allocInit(12, 3); {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1726#true} {1726#true} #98#return; {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1726#true} call #t~ret6 := main(); {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1726#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L272 TraceCheckUtils]: 6: Hoare triple {1726#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1726#true} {1726#true} #78#return; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {1726#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {1726#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1726#true} {1726#true} #80#return; {1726#true} is VALID [2022-04-28 04:48:51,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {1726#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {1726#true} ~cond := #in~cond; {1785#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:48:51,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1789#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:51,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {1789#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1789#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:48:51,230 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1789#(not (= |assume_abort_if_not_#in~cond| 0))} {1726#true} #82#return; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 04:48:51,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {1796#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 04:48:51,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(<= 1 main_~y~0)} assume !false; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 04:48:51,231 INFO L272 TraceCheckUtils]: 24: Hoare triple {1796#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,232 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1726#true} {1796#(<= 1 main_~y~0)} #84#return; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 04:48:51,232 INFO L272 TraceCheckUtils]: 29: Hoare triple {1796#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,233 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1726#true} {1796#(<= 1 main_~y~0)} #86#return; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 04:48:51,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {1796#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1836#(<= 1 main_~r~0)} is VALID [2022-04-28 04:48:51,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {1836#(<= 1 main_~r~0)} assume !false; {1836#(<= 1 main_~r~0)} is VALID [2022-04-28 04:48:51,234 INFO L272 TraceCheckUtils]: 36: Hoare triple {1836#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,235 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1726#true} {1836#(<= 1 main_~r~0)} #88#return; {1836#(<= 1 main_~r~0)} is VALID [2022-04-28 04:48:51,235 INFO L272 TraceCheckUtils]: 41: Hoare triple {1836#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1726#true} is VALID [2022-04-28 04:48:51,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 04:48:51,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 04:48:51,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 04:48:51,235 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1726#true} {1836#(<= 1 main_~r~0)} #90#return; {1836#(<= 1 main_~r~0)} is VALID [2022-04-28 04:48:51,236 INFO L272 TraceCheckUtils]: 46: Hoare triple {1836#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1873#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:51,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {1873#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1877#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:51,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {1877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1727#false} is VALID [2022-04-28 04:48:51,237 INFO L290 TraceCheckUtils]: 49: Hoare triple {1727#false} assume !false; {1727#false} is VALID [2022-04-28 04:48:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 04:48:51,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:48:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113875826] [2022-04-28 04:48:51,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:51,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168343343] [2022-04-28 04:48:51,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168343343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:51,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:51,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:48:51,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:51,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702000897] [2022-04-28 04:48:51,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702000897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:51,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:51,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:48:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631740909] [2022-04-28 04:48:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-28 04:48:51,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:51,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:48:51,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:51,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:48:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:51,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:48:51,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:48:51,307 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:48:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:51,650 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 04:48:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:48:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 50 [2022-04-28 04:48:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:48:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:48:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:48:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:48:51,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 04:48:51,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:51,696 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:48:51,696 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 04:48:51,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:48:51,697 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:51,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:48:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 04:48:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 04:48:51,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:51,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:51,760 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:51,760 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:51,762 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 04:48:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 04:48:51,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:51,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:51,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-28 04:48:51,764 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 61 states. [2022-04-28 04:48:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:51,766 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 04:48:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 04:48:51,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:51,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:51,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:51,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-28 04:48:51,769 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-28 04:48:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:51,770 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-28 04:48:51,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 04:48:51,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-28 04:48:51,855 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 04:48:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 04:48:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 04:48:51,856 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:51,856 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:48:51,881 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 04:48:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:52,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 1 times [2022-04-28 04:48:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:52,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484420644] [2022-04-28 04:48:52,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 2 times [2022-04-28 04:48:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:52,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084337062] [2022-04-28 04:48:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:52,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2028957044] [2022-04-28 04:48:52,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:52,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:52,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:52,092 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 04:48:52,093 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 04:48:52,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:48:52,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:52,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:48:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:52,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:52,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 04:48:52,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#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(14, 2);call #Ultimate.allocInit(12, 3); {2259#true} is VALID [2022-04-28 04:48:52,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #98#return; {2259#true} is VALID [2022-04-28 04:48:52,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret6 := main(); {2259#true} is VALID [2022-04-28 04:48:52,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2259#true} is VALID [2022-04-28 04:48:52,387 INFO L272 TraceCheckUtils]: 6: Hoare triple {2259#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#true} {2259#true} #78#return; {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {2259#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2259#true} {2259#true} #80#return; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {2259#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2259#true} {2259#true} #82#return; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {2259#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L272 TraceCheckUtils]: 24: Hoare triple {2259#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2259#true} {2259#true} #84#return; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L272 TraceCheckUtils]: 29: Hoare triple {2259#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2259#true} {2259#true} #86#return; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {2259#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 04:48:52,390 INFO L272 TraceCheckUtils]: 36: Hoare triple {2259#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {2259#true} ~cond := #in~cond; {2375#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:52,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {2375#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:52,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:52,396 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} {2259#true} #88#return; {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:48:52,397 INFO L272 TraceCheckUtils]: 41: Hoare triple {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,398 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2259#true} {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} #90#return; {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:48:52,398 INFO L272 TraceCheckUtils]: 46: Hoare triple {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:52,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:52,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:52,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:52,399 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2259#true} {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} #92#return; {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-28 04:48:52,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {2386#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2420#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 04:48:52,401 INFO L272 TraceCheckUtils]: 52: Hoare triple {2420#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:52,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {2424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:52,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {2428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 04:48:52,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 04:48:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 04:48:52,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:48:56,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 04:48:56,814 INFO L290 TraceCheckUtils]: 54: Hoare triple {2428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 04:48:56,815 INFO L290 TraceCheckUtils]: 53: Hoare triple {2424#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2428#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:56,816 INFO L272 TraceCheckUtils]: 52: Hoare triple {2420#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2424#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:56,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2420#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-28 04:48:56,817 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2259#true} {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #92#return; {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:48:56,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,817 INFO L272 TraceCheckUtils]: 46: Hoare triple {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,819 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2259#true} {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #90#return; {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:48:56,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,819 INFO L272 TraceCheckUtils]: 41: Hoare triple {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,820 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} {2259#true} #88#return; {2447#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-28 04:48:56,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:56,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {2490#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2379#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:56,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {2259#true} ~cond := #in~cond; {2490#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:48:56,822 INFO L272 TraceCheckUtils]: 36: Hoare triple {2259#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {2259#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2259#true} {2259#true} #86#return; {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L272 TraceCheckUtils]: 29: Hoare triple {2259#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,822 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2259#true} {2259#true} #84#return; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L272 TraceCheckUtils]: 24: Hoare triple {2259#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {2259#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2259#true} {2259#true} #82#return; {2259#true} is VALID [2022-04-28 04:48:56,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L272 TraceCheckUtils]: 17: Hoare triple {2259#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2259#true} {2259#true} #80#return; {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L272 TraceCheckUtils]: 12: Hoare triple {2259#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {2259#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#true} {2259#true} #78#return; {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L272 TraceCheckUtils]: 6: Hoare triple {2259#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {2259#true} is VALID [2022-04-28 04:48:56,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {2259#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret6 := main(); {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #98#return; {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {2259#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(14, 2);call #Ultimate.allocInit(12, 3); {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 04:48:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 04:48:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084337062] [2022-04-28 04:48:56,827 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028957044] [2022-04-28 04:48:56,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028957044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:48:56,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:48:56,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 04:48:56,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484420644] [2022-04-28 04:48:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484420644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:56,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:56,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:48:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894054922] [2022-04-28 04:48:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-28 04:48:56,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:56,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 04:48:56,861 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 04:48:56,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:48:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:56,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:48:56,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:48:56,862 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 04:48:57,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:57,297 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 04:48:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:48:57,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-04-28 04:48:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 04:48:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:48:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 04:48:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:48:57,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 04:48:57,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:57,351 INFO L225 Difference]: With dead ends: 67 [2022-04-28 04:48:57,351 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 04:48:57,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:48:57,352 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:57,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 141 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:48:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 04:48:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 04:48:57,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:57,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:57,412 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:57,412 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:57,415 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 04:48:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 04:48:57,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:57,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:57,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-28 04:48:57,416 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 65 states. [2022-04-28 04:48:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:57,419 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 04:48:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 04:48:57,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:57,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:57,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:57,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:48:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 04:48:57,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-28 04:48:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:57,423 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 04:48:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 04:48:57,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-28 04:48:57,501 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 04:48:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 04:48:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 04:48:57,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:57,503 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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 04:48:57,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 04:48:57,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:57,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 1 times [2022-04-28 04:48:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:57,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220883345] [2022-04-28 04:48:57,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:57,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 2 times [2022-04-28 04:48:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149493237] [2022-04-28 04:48:57,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:57,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:57,720 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:57,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069739335] [2022-04-28 04:48:57,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:48:57,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:57,722 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 04:48:57,736 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 04:48:57,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:48:57,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:57,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 04:48:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:57,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:58,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {3004#true} call ULTIMATE.init(); {3004#true} is VALID [2022-04-28 04:48:58,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {3004#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(14, 2);call #Ultimate.allocInit(12, 3); {3004#true} is VALID [2022-04-28 04:48:58,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3004#true} {3004#true} #98#return; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {3004#true} call #t~ret6 := main(); {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {3004#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {3004#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3004#true} {3004#true} #78#return; {3004#true} is VALID [2022-04-28 04:48:58,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3004#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {3004#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3004#true} {3004#true} #80#return; {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L272 TraceCheckUtils]: 17: Hoare triple {3004#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,044 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3004#true} {3004#true} #82#return; {3004#true} is VALID [2022-04-28 04:48:58,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {3004#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,045 INFO L272 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,051 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3004#true} {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #84#return; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,052 INFO L272 TraceCheckUtils]: 29: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,053 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3004#true} {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #86#return; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,054 INFO L272 TraceCheckUtils]: 36: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,055 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3004#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,055 INFO L272 TraceCheckUtils]: 41: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,056 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3004#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #90#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,056 INFO L272 TraceCheckUtils]: 46: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,057 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3004#true} {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #92#return; {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 04:48:58,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {3112#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 04:48:58,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !false; {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 04:48:58,059 INFO L272 TraceCheckUtils]: 54: Hoare triple {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:48:58,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:48:58,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:48:58,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:48:58,060 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3004#true} {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #84#return; {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 04:48:58,060 INFO L272 TraceCheckUtils]: 59: Hoare triple {3167#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:58,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {3189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:58,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3005#false} is VALID [2022-04-28 04:48:58,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-04-28 04:48:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 04:48:58,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:49:14,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-04-28 04:49:14,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3005#false} is VALID [2022-04-28 04:49:14,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {3189#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3193#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:14,442 INFO L272 TraceCheckUtils]: 59: Hoare triple {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3189#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:14,443 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {3004#true} {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #84#return; {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 04:49:14,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,444 INFO L272 TraceCheckUtils]: 54: Hoare triple {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 04:49:14,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3209#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-28 04:49:14,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,471 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3004#true} {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #92#return; {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,472 INFO L272 TraceCheckUtils]: 46: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,472 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3004#true} {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #90#return; {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,473 INFO L272 TraceCheckUtils]: 41: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,473 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3004#true} {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #88#return; {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,474 INFO L290 TraceCheckUtils]: 39: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,474 INFO L272 TraceCheckUtils]: 36: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !false; {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,475 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3231#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-28 04:49:14,475 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3004#true} {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #86#return; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:49:14,476 INFO L290 TraceCheckUtils]: 32: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,476 INFO L272 TraceCheckUtils]: 29: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,477 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3004#true} {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #84#return; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:49:14,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,477 INFO L272 TraceCheckUtils]: 24: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:49:14,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {3004#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3075#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 04:49:14,478 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3004#true} {3004#true} #82#return; {3004#true} is VALID [2022-04-28 04:49:14,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L272 TraceCheckUtils]: 17: Hoare triple {3004#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3004#true} {3004#true} #80#return; {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L272 TraceCheckUtils]: 12: Hoare triple {3004#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {3004#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3004#true} is VALID [2022-04-28 04:49:14,479 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3004#true} {3004#true} #78#return; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {3004#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {3004#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {3004#true} call #t~ret6 := main(); {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3004#true} {3004#true} #98#return; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 04:49:14,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {3004#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(14, 2);call #Ultimate.allocInit(12, 3); {3004#true} is VALID [2022-04-28 04:49:14,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {3004#true} call ULTIMATE.init(); {3004#true} is VALID [2022-04-28 04:49:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 04:49:14,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149493237] [2022-04-28 04:49:14,481 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:49:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069739335] [2022-04-28 04:49:14,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069739335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:49:14,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:49:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 04:49:14,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220883345] [2022-04-28 04:49:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220883345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:49:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657336734] [2022-04-28 04:49:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-28 04:49:14,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:14,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 04:49:14,521 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 04:49:14,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:49:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:14,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:49:14,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:49:14,522 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 04:49:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:15,102 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 04:49:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:49:15,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 63 [2022-04-28 04:49:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 04:49:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 04:49:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 04:49:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 04:49:15,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 04:49:15,205 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 04:49:15,209 INFO L225 Difference]: With dead ends: 97 [2022-04-28 04:49:15,209 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 04:49:15,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:49:15,210 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:15,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 197 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:49:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 04:49:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-04-28 04:49:15,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:15,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 04:49:15,330 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 04:49:15,331 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 04:49:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:15,336 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 04:49:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 04:49:15,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:15,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:15,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-28 04:49:15,339 INFO L87 Difference]: Start difference. First operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 94 states. [2022-04-28 04:49:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:15,347 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 04:49:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 04:49:15,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:15,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:15,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:15,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 27 states have call successors, (27), 11 states have call predecessors, (27), 10 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 04:49:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-04-28 04:49:15,353 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 63 [2022-04-28 04:49:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:15,353 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-04-28 04:49:15,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-28 04:49:15,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 110 transitions. [2022-04-28 04:49:15,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 04:49:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 04:49:15,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:15,488 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:15,512 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 04:49:15,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:15,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 1 times [2022-04-28 04:49:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [234615731] [2022-04-28 04:49:15,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 2 times [2022-04-28 04:49:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:15,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253288852] [2022-04-28 04:49:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:15,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:49:15,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440183793] [2022-04-28 04:49:15,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:49:15,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:15,722 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 04:49:15,724 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 04:49:15,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:49:15,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:49:15,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 04:49:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:15,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:49:16,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {3954#true} call ULTIMATE.init(); {3954#true} is VALID [2022-04-28 04:49:16,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#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(14, 2);call #Ultimate.allocInit(12, 3); {3954#true} is VALID [2022-04-28 04:49:16,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3954#true} {3954#true} #98#return; {3954#true} is VALID [2022-04-28 04:49:16,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {3954#true} call #t~ret6 := main(); {3954#true} is VALID [2022-04-28 04:49:16,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {3954#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3954#true} is VALID [2022-04-28 04:49:16,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {3954#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {3954#true} ~cond := #in~cond; {3980#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:49:16,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {3980#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3984#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:49:16,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {3984#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3984#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:49:16,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3984#(not (= |assume_abort_if_not_#in~cond| 0))} {3954#true} #78#return; {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,841 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3954#true} {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #80#return; {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,841 INFO L272 TraceCheckUtils]: 17: Hoare triple {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,842 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3954#true} {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #82#return; {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {3991#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} assume !false; {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,843 INFO L272 TraceCheckUtils]: 24: Hoare triple {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,845 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3954#true} {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} #84#return; {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,845 INFO L272 TraceCheckUtils]: 29: Hoare triple {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,848 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3954#true} {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} #86#return; {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {4028#(and (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~q~0 0) (<= main_~x~0 2))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} assume !false; {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,849 INFO L272 TraceCheckUtils]: 36: Hoare triple {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {3954#true} ~cond := #in~cond; {4075#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:16,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {4075#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:16,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {4079#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:16,851 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4079#(not (= |__VERIFIER_assert_#in~cond| 0))} {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} #88#return; {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,851 INFO L272 TraceCheckUtils]: 41: Hoare triple {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,852 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3954#true} {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} #90#return; {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,852 INFO L272 TraceCheckUtils]: 46: Hoare triple {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,854 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3954#true} {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} #92#return; {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {4065#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} assume !!(~r~0 >= 2 * ~b~0); {4119#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,854 INFO L272 TraceCheckUtils]: 52: Hoare triple {4119#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,855 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {3954#true} {4119#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} #94#return; {4119#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {4119#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= 0 main_~x~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} assume !false; {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,857 INFO L272 TraceCheckUtils]: 59: Hoare triple {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,858 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3954#true} {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} #88#return; {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,858 INFO L272 TraceCheckUtils]: 64: Hoare triple {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,859 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {3954#true} {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} #90#return; {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,859 INFO L272 TraceCheckUtils]: 69: Hoare triple {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,861 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {3954#true} {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} #92#return; {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {4138#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= 0 main_~x~0) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} assume !(~r~0 >= 2 * ~b~0); {4190#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (< main_~r~0 (* main_~b~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {4190#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (< main_~r~0 (* main_~b~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2) (<= main_~x~0 2))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} assume !false; {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,863 INFO L272 TraceCheckUtils]: 77: Hoare triple {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3954#true} is VALID [2022-04-28 04:49:16,863 INFO L290 TraceCheckUtils]: 78: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 04:49:16,863 INFO L290 TraceCheckUtils]: 79: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 04:49:16,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 04:49:16,864 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {3954#true} {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} #84#return; {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} is VALID [2022-04-28 04:49:16,865 INFO L272 TraceCheckUtils]: 82: Hoare triple {4194#(and (= main_~q~0 2) (< main_~r~0 (* main_~y~0 2)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) (<= main_~x~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {4216#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:16,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {4216#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4220#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:16,866 INFO L290 TraceCheckUtils]: 84: Hoare triple {4220#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3955#false} is VALID [2022-04-28 04:49:16,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {3955#false} assume !false; {3955#false} is VALID [2022-04-28 04:49:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-28 04:49:16,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:50:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:50:02,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253288852] [2022-04-28 04:50:02,103 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:50:02,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440183793] [2022-04-28 04:50:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440183793] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:50:02,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 04:50:02,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 04:50:02,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:50:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [234615731] [2022-04-28 04:50:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [234615731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:50:02,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:50:02,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:50:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683111181] [2022-04-28 04:50:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:50:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 86 [2022-04-28 04:50:02,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:50:02,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 04:50:02,160 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 04:50:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:50:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:50:02,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:50:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:50:02,161 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 04:50:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:03,817 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2022-04-28 04:50:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:50:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 86 [2022-04-28 04:50:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:50:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 04:50:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-28 04:50:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 04:50:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-28 04:50:03,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 126 transitions. [2022-04-28 04:50:03,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:03,950 INFO L225 Difference]: With dead ends: 153 [2022-04-28 04:50:03,950 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 04:50:03,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:50:03,952 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:50:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 216 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:50:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 04:50:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 04:50:04,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:50:04,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 04:50:04,109 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 04:50:04,110 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 04:50:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:04,114 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-04-28 04:50:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-04-28 04:50:04,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:04,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:04,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 112 states. [2022-04-28 04:50:04,115 INFO L87 Difference]: Start difference. First operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 112 states. [2022-04-28 04:50:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:04,124 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-04-28 04:50:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-04-28 04:50:04,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:04,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:04,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:50:04,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:50:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 04:50:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2022-04-28 04:50:04,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 86 [2022-04-28 04:50:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:50:04,130 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2022-04-28 04:50:04,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 7 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-28 04:50:04,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 130 transitions. [2022-04-28 04:50:04,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2022-04-28 04:50:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 04:50:04,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:50:04,293 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-04-28 04:50:04,310 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 04:50:04,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:50:04,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:50:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:50:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash -895340852, now seen corresponding path program 3 times [2022-04-28 04:50:04,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:50:04,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873139452] [2022-04-28 04:50:04,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:50:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash -895340852, now seen corresponding path program 4 times [2022-04-28 04:50:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:50:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772957459] [2022-04-28 04:50:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:50:04,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:50:04,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:50:04,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636547952] [2022-04-28 04:50:04,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:50:04,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:50:04,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:50:04,517 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 04:50:04,545 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 04:50:04,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:50:04,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:50:04,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 04:50:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:50:04,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:50:04,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {5147#true} call ULTIMATE.init(); {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {5147#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(14, 2);call #Ultimate.allocInit(12, 3); {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5147#true} {5147#true} #98#return; {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {5147#true} call #t~ret6 := main(); {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {5147#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {5147#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5147#true} {5147#true} #78#return; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {5147#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L272 TraceCheckUtils]: 12: Hoare triple {5147#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5147#true} {5147#true} #80#return; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L272 TraceCheckUtils]: 17: Hoare triple {5147#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5147#true} {5147#true} #82#return; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {5147#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {5147#true} assume !false; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L272 TraceCheckUtils]: 24: Hoare triple {5147#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,817 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5147#true} {5147#true} #84#return; {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L272 TraceCheckUtils]: 29: Hoare triple {5147#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5147#true} {5147#true} #86#return; {5147#true} is VALID [2022-04-28 04:50:04,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {5147#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5254#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 04:50:04,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {5254#(<= main_~b~0 main_~y~0)} assume !false; {5254#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 04:50:04,819 INFO L272 TraceCheckUtils]: 36: Hoare triple {5254#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5147#true} {5254#(<= main_~b~0 main_~y~0)} #88#return; {5254#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 04:50:04,819 INFO L272 TraceCheckUtils]: 41: Hoare triple {5254#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,819 INFO L290 TraceCheckUtils]: 43: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,820 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5147#true} {5254#(<= main_~b~0 main_~y~0)} #90#return; {5254#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 04:50:04,820 INFO L272 TraceCheckUtils]: 46: Hoare triple {5254#(<= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,821 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5147#true} {5254#(<= main_~b~0 main_~y~0)} #92#return; {5254#(<= main_~b~0 main_~y~0)} is VALID [2022-04-28 04:50:04,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {5254#(<= main_~b~0 main_~y~0)} assume !(~r~0 >= 2 * ~b~0); {5306#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} is VALID [2022-04-28 04:50:04,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {5306#(and (not (<= (* main_~b~0 2) main_~r~0)) (<= main_~b~0 main_~y~0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5310#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 04:50:04,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {5310#(< main_~r~0 main_~y~0)} assume !false; {5310#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 04:50:04,822 INFO L272 TraceCheckUtils]: 54: Hoare triple {5310#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,822 INFO L290 TraceCheckUtils]: 55: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,823 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5147#true} {5310#(< main_~r~0 main_~y~0)} #84#return; {5310#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 04:50:04,823 INFO L272 TraceCheckUtils]: 59: Hoare triple {5310#(< main_~r~0 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5147#true} is VALID [2022-04-28 04:50:04,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 04:50:04,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 04:50:04,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 04:50:04,824 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {5147#true} {5310#(< main_~r~0 main_~y~0)} #86#return; {5310#(< main_~r~0 main_~y~0)} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {5310#(< main_~r~0 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L272 TraceCheckUtils]: 66: Hoare triple {5148#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5148#false} {5148#false} #88#return; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L272 TraceCheckUtils]: 71: Hoare triple {5148#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 04:50:04,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5148#false} {5148#false} #90#return; {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L272 TraceCheckUtils]: 76: Hoare triple {5148#false} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 79: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5148#false} {5148#false} #92#return; {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {5148#false} assume !(~r~0 >= 2 * ~b~0); {5148#false} is VALID [2022-04-28 04:50:04,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {5148#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L272 TraceCheckUtils]: 84: Hoare triple {5148#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L290 TraceCheckUtils]: 85: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L290 TraceCheckUtils]: 86: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L290 TraceCheckUtils]: 87: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5148#false} {5148#false} #84#return; {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L272 TraceCheckUtils]: 89: Hoare triple {5148#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {5148#false} is VALID [2022-04-28 04:50:04,826 INFO L290 TraceCheckUtils]: 90: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 04:50:04,827 INFO L290 TraceCheckUtils]: 91: Hoare triple {5148#false} assume 0 == ~cond; {5148#false} is VALID [2022-04-28 04:50:04,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 04:50:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-28 04:50:04,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:50:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:50:04,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772957459] [2022-04-28 04:50:04,828 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:50:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636547952] [2022-04-28 04:50:04,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636547952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:50:04,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:50:04,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:50:04,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:50:04,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873139452] [2022-04-28 04:50:04,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873139452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:50:04,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:50:04,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:50:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699868767] [2022-04-28 04:50:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:50:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 93 [2022-04-28 04:50:04,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:50:04,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 04:50:04,883 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 04:50:04,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:50:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:50:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:50:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:50:04,884 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 04:50:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:05,194 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2022-04-28 04:50:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:50:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 93 [2022-04-28 04:50:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:50:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 04:50:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-28 04:50:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 04:50:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-28 04:50:05,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-04-28 04:50:05,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:05,273 INFO L225 Difference]: With dead ends: 157 [2022-04-28 04:50:05,273 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 04:50:05,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:50:05,278 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:50:05,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:50:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 04:50:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2022-04-28 04:50:05,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:50:05,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:50:05,447 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:50:05,448 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:50:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:05,451 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 04:50:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-04-28 04:50:05,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:05,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:05,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-28 04:50:05,453 INFO L87 Difference]: Start difference. First operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-28 04:50:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:05,456 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 04:50:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-04-28 04:50:05,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:05,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:05,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:50:05,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:50:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 30 states have call successors, (30), 13 states have call predecessors, (30), 12 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-28 04:50:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-04-28 04:50:05,460 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 93 [2022-04-28 04:50:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:50:05,460 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-04-28 04:50:05,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 04:50:05,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 123 transitions. [2022-04-28 04:50:05,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-04-28 04:50:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 04:50:05,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:50:05,618 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-04-28 04:50:05,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 04:50:05,819 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,SelfDestructingSolverStorable8 [2022-04-28 04:50:05,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:50:05,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:50:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -39671046, now seen corresponding path program 3 times [2022-04-28 04:50:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:50:05,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884208478] [2022-04-28 04:50:05,820 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:50:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -39671046, now seen corresponding path program 4 times [2022-04-28 04:50:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:50:05,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406208884] [2022-04-28 04:50:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:50:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:50:05,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:50:05,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631964337] [2022-04-28 04:50:05,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:50:05,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:50:05,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:50:05,846 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 04:50:05,849 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 04:50:05,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:50:05,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:50:05,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:50:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:50:05,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:50:07,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {6165#true} call ULTIMATE.init(); {6165#true} is VALID [2022-04-28 04:50:07,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {6165#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(14, 2);call #Ultimate.allocInit(12, 3); {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6165#true} {6165#true} #98#return; {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {6165#true} call #t~ret6 := main(); {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {6165#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {6165#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {6165#true} ~cond := #in~cond; {6191#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:50:07,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {6191#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6195#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:50:07,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {6195#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6195#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:50:07,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6195#(not (= |assume_abort_if_not_#in~cond| 0))} {6165#true} #78#return; {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:50:07,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:50:07,500 INFO L272 TraceCheckUtils]: 12: Hoare triple {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6165#true} {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #80#return; {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:50:07,500 INFO L272 TraceCheckUtils]: 17: Hoare triple {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,501 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6165#true} {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} #82#return; {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:50:07,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {6202#(and (<= 0 main_~x~0) (<= main_~x~0 2))} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {6239#(<= main_~r~0 2)} assume !false; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,502 INFO L272 TraceCheckUtils]: 24: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,503 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #84#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,503 INFO L272 TraceCheckUtils]: 29: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,504 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #86#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {6239#(<= main_~r~0 2)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {6239#(<= main_~r~0 2)} assume !false; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,505 INFO L272 TraceCheckUtils]: 36: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,506 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #88#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,506 INFO L272 TraceCheckUtils]: 41: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,506 INFO L290 TraceCheckUtils]: 42: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,506 INFO L290 TraceCheckUtils]: 43: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,507 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #90#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,507 INFO L272 TraceCheckUtils]: 46: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,507 INFO L290 TraceCheckUtils]: 47: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,507 INFO L290 TraceCheckUtils]: 48: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,507 INFO L290 TraceCheckUtils]: 49: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,508 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #92#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,508 INFO L290 TraceCheckUtils]: 51: Hoare triple {6239#(<= main_~r~0 2)} assume !!(~r~0 >= 2 * ~b~0); {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,508 INFO L272 TraceCheckUtils]: 52: Hoare triple {6239#(<= main_~r~0 2)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,509 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6165#true} {6239#(<= main_~r~0 2)} #94#return; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 04:50:07,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {6239#(<= main_~r~0 2)} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} assume !false; {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,511 INFO L272 TraceCheckUtils]: 59: Hoare triple {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,512 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6165#true} {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} #88#return; {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,512 INFO L272 TraceCheckUtils]: 64: Hoare triple {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,512 INFO L290 TraceCheckUtils]: 66: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,512 INFO L290 TraceCheckUtils]: 67: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,513 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6165#true} {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} #90#return; {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,513 INFO L272 TraceCheckUtils]: 69: Hoare triple {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,513 INFO L290 TraceCheckUtils]: 70: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,513 INFO L290 TraceCheckUtils]: 71: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,513 INFO L290 TraceCheckUtils]: 72: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,514 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6165#true} {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} #92#return; {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {6345#(and (= (mod main_~b~0 2) 0) (<= main_~r~0 2))} assume !!(~r~0 >= 2 * ~b~0); {6397#(and (= (mod main_~b~0 2) 0) (<= (* main_~b~0 2) main_~r~0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,514 INFO L272 TraceCheckUtils]: 75: Hoare triple {6397#(and (= (mod main_~b~0 2) 0) (<= (* main_~b~0 2) main_~r~0) (<= main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,514 INFO L290 TraceCheckUtils]: 76: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,514 INFO L290 TraceCheckUtils]: 77: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,515 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6165#true} {6397#(and (= (mod main_~b~0 2) 0) (<= (* main_~b~0 2) main_~r~0) (<= main_~r~0 2))} #94#return; {6397#(and (= (mod main_~b~0 2) 0) (<= (* main_~b~0 2) main_~r~0) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,517 INFO L290 TraceCheckUtils]: 80: Hoare triple {6397#(and (= (mod main_~b~0 2) 0) (<= (* main_~b~0 2) main_~r~0) (<= main_~r~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,517 INFO L290 TraceCheckUtils]: 81: Hoare triple {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} assume !false; {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,517 INFO L272 TraceCheckUtils]: 82: Hoare triple {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,518 INFO L290 TraceCheckUtils]: 84: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,518 INFO L290 TraceCheckUtils]: 85: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,518 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6165#true} {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} #88#return; {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,518 INFO L272 TraceCheckUtils]: 87: Hoare triple {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,519 INFO L290 TraceCheckUtils]: 88: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,519 INFO L290 TraceCheckUtils]: 89: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,519 INFO L290 TraceCheckUtils]: 90: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,519 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {6165#true} {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} #90#return; {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,519 INFO L272 TraceCheckUtils]: 92: Hoare triple {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:07,520 INFO L290 TraceCheckUtils]: 93: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:07,520 INFO L290 TraceCheckUtils]: 94: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:07,520 INFO L290 TraceCheckUtils]: 95: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:07,520 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {6165#true} {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} #92#return; {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} is VALID [2022-04-28 04:50:07,521 INFO L290 TraceCheckUtils]: 97: Hoare triple {6416#(and (<= (div (- main_~b~0) (- 4)) (div main_~r~0 4)) (<= main_~r~0 2))} assume !(~r~0 >= 2 * ~b~0); {6166#false} is VALID [2022-04-28 04:50:07,521 INFO L290 TraceCheckUtils]: 98: Hoare triple {6166#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6166#false} is VALID [2022-04-28 04:50:07,521 INFO L290 TraceCheckUtils]: 99: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 04:50:07,521 INFO L272 TraceCheckUtils]: 100: Hoare triple {6166#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 101: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 102: Hoare triple {6166#false} assume !(0 == ~cond); {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 103: Hoare triple {6166#false} assume true; {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {6166#false} {6166#false} #84#return; {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L272 TraceCheckUtils]: 105: Hoare triple {6166#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 107: Hoare triple {6166#false} assume 0 == ~cond; {6166#false} is VALID [2022-04-28 04:50:07,522 INFO L290 TraceCheckUtils]: 108: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 04:50:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 93 proven. 11 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-04-28 04:50:07,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:50:08,680 INFO L290 TraceCheckUtils]: 108: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 107: Hoare triple {6166#false} assume 0 == ~cond; {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 106: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L272 TraceCheckUtils]: 105: Hoare triple {6166#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {6165#true} {6166#false} #84#return; {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 103: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 102: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 101: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,681 INFO L272 TraceCheckUtils]: 100: Hoare triple {6166#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 99: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 04:50:08,681 INFO L290 TraceCheckUtils]: 98: Hoare triple {6166#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {6166#false} is VALID [2022-04-28 04:50:08,682 INFO L290 TraceCheckUtils]: 97: Hoare triple {6534#(<= (* main_~b~0 2) main_~r~0)} assume !(~r~0 >= 2 * ~b~0); {6166#false} is VALID [2022-04-28 04:50:08,682 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {6165#true} {6534#(<= (* main_~b~0 2) main_~r~0)} #92#return; {6534#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 04:50:08,682 INFO L290 TraceCheckUtils]: 95: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,682 INFO L290 TraceCheckUtils]: 94: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,682 INFO L290 TraceCheckUtils]: 93: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,682 INFO L272 TraceCheckUtils]: 92: Hoare triple {6534#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,683 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {6165#true} {6534#(<= (* main_~b~0 2) main_~r~0)} #90#return; {6534#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 04:50:08,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,683 INFO L272 TraceCheckUtils]: 87: Hoare triple {6534#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,684 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6165#true} {6534#(<= (* main_~b~0 2) main_~r~0)} #88#return; {6534#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 04:50:08,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,684 INFO L272 TraceCheckUtils]: 82: Hoare triple {6534#(<= (* main_~b~0 2) main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,684 INFO L290 TraceCheckUtils]: 81: Hoare triple {6534#(<= (* main_~b~0 2) main_~r~0)} assume !false; {6534#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 04:50:08,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {6586#(<= (* main_~b~0 2) (div main_~r~0 2))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6534#(<= (* main_~b~0 2) main_~r~0)} is VALID [2022-04-28 04:50:08,685 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {6165#true} {6586#(<= (* main_~b~0 2) (div main_~r~0 2))} #94#return; {6586#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-28 04:50:08,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,686 INFO L272 TraceCheckUtils]: 75: Hoare triple {6586#(<= (* main_~b~0 2) (div main_~r~0 2))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,702 INFO L290 TraceCheckUtils]: 74: Hoare triple {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !!(~r~0 >= 2 * ~b~0); {6586#(<= (* main_~b~0 2) (div main_~r~0 2))} is VALID [2022-04-28 04:50:08,702 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {6165#true} {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #92#return; {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,702 INFO L272 TraceCheckUtils]: 69: Hoare triple {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,703 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6165#true} {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #90#return; {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,703 INFO L272 TraceCheckUtils]: 64: Hoare triple {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,707 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6165#true} {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} #88#return; {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,707 INFO L272 TraceCheckUtils]: 59: Hoare triple {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} assume !false; {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {6605#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 2) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,709 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {6165#true} {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} #94#return; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,709 INFO L272 TraceCheckUtils]: 52: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,710 INFO L290 TraceCheckUtils]: 51: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} assume !!(~r~0 >= 2 * ~b~0); {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,710 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6165#true} {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} #92#return; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,710 INFO L290 TraceCheckUtils]: 48: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,710 INFO L272 TraceCheckUtils]: 46: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,711 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6165#true} {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} #90#return; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,711 INFO L272 TraceCheckUtils]: 41: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,712 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6165#true} {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} #88#return; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,712 INFO L290 TraceCheckUtils]: 38: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,712 INFO L272 TraceCheckUtils]: 36: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} assume !false; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {6657#(or (not (<= (* main_~b~0 4) main_~r~0)) (<= (* main_~b~0 4) (div main_~r~0 2)))} is VALID [2022-04-28 04:50:08,721 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6165#true} {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} #86#return; {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} is VALID [2022-04-28 04:50:08,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,722 INFO L272 TraceCheckUtils]: 29: Hoare triple {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,722 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6165#true} {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} #84#return; {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} is VALID [2022-04-28 04:50:08,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,723 INFO L272 TraceCheckUtils]: 24: Hoare triple {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} assume !false; {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} is VALID [2022-04-28 04:50:08,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {6727#(<= (div main_~r~0 4) (div (div main_~r~0 2) 4))} is VALID [2022-04-28 04:50:08,725 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6165#true} {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} #82#return; {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} is VALID [2022-04-28 04:50:08,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,725 INFO L272 TraceCheckUtils]: 17: Hoare triple {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,726 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6165#true} {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} #80#return; {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} is VALID [2022-04-28 04:50:08,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 04:50:08,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 04:50:08,726 INFO L272 TraceCheckUtils]: 12: Hoare triple {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 2 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} is VALID [2022-04-28 04:50:08,728 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6195#(not (= |assume_abort_if_not_#in~cond| 0))} {6165#true} #78#return; {6764#(<= (div (+ (- 1) (* (- 1) main_~x~0)) (- 4)) 1)} is VALID [2022-04-28 04:50:08,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {6195#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6195#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:50:08,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {6810#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {6195#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:50:08,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {6165#true} ~cond := #in~cond; {6810#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 04:50:08,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {6165#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 2 then 1 else 0)); {6165#true} is VALID [2022-04-28 04:50:08,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {6165#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6165#true} is VALID [2022-04-28 04:50:08,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {6165#true} call #t~ret6 := main(); {6165#true} is VALID [2022-04-28 04:50:08,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6165#true} {6165#true} #98#return; {6165#true} is VALID [2022-04-28 04:50:08,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 04:50:08,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {6165#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(14, 2);call #Ultimate.allocInit(12, 3); {6165#true} is VALID [2022-04-28 04:50:08,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {6165#true} call ULTIMATE.init(); {6165#true} is VALID [2022-04-28 04:50:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-04-28 04:50:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:50:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406208884] [2022-04-28 04:50:08,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:50:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631964337] [2022-04-28 04:50:08,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631964337] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:50:08,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:50:08,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2022-04-28 04:50:08,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:50:08,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884208478] [2022-04-28 04:50:08,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884208478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:50:08,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:50:08,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:50:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381241504] [2022-04-28 04:50:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:50:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 109 [2022-04-28 04:50:08,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:50:08,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 04:50:08,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:50:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:50:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:50:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:50:08,796 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 04:50:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:09,918 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 04:50:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:50:09,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 109 [2022-04-28 04:50:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:50:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 04:50:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-04-28 04:50:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 04:50:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-04-28 04:50:09,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 86 transitions. [2022-04-28 04:50:10,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:10,006 INFO L225 Difference]: With dead ends: 113 [2022-04-28 04:50:10,006 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:50:10,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:50:10,007 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:50:10,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:50:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:50:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:50:10,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:50:10,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:50:10,008 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:50:10,008 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:50:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:10,008 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:50:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:50:10,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:10,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:10,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:50:10,009 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:50:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:50:10,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:50:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:50:10,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:10,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:50:10,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:50:10,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:50:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:50:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:50:10,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-04-28 04:50:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:50:10,009 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:50:10,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 04:50:10,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:50:10,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:50:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:50:10,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:50:10,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:50:10,032 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 04:50:10,223 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,SelfDestructingSolverStorable9 [2022-04-28 04:50:10,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:50:12,489 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 04:50:12,490 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 04:50:12,490 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 04:50:12,490 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-28 04:50:12,490 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (<= main_~y~0 2) (<= 0 main_~x~0) (<= 1 main_~y~0) (<= main_~x~0 2)) [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~y~0) (<= main_~y~0 2) (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-28 04:50:12,490 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 04:50:12,490 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 2)) [2022-04-28 04:50:12,490 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 66) the Hoare annotation is: true [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L50(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse5 (<= main_~y~0 2)) (.cse6 (<= 1 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= (* main_~y~0 2) main_~r~0) .cse1 (= main_~a~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse5 (= (mod main_~b~0 2) 0) .cse6 (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 (= main_~b~0 main_~y~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse5 (<= main_~y~0 2)) (.cse6 (<= 1 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= (* main_~y~0 2) main_~r~0) .cse1 (= main_~a~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse5 (= (mod main_~b~0 2) 0) .cse6 (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 (= main_~b~0 main_~y~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse5 (<= main_~y~0 2)) (.cse6 (<= 1 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= (* main_~y~0 2) main_~r~0) .cse1 (= main_~a~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse5 (= (mod main_~b~0 2) 0) .cse6 (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 (= main_~b~0 main_~y~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 04:50:12,491 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 66) the Hoare annotation is: true [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L40(lines 38 62) the Hoare annotation is: (let ((.cse2 (<= 1 main_~y~0)) (.cse0 (<= main_~y~0 2)) (.cse1 (<= 0 main_~x~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and (= main_~x~0 main_~r~0) .cse0 .cse1 (= (mod main_~b~0 2) 0) (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) (= main_~q~0 0) .cse2 .cse3 .cse4) (and (= main_~q~0 2) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse2 .cse3 .cse4) (and (< main_~r~0 main_~y~0) .cse0 .cse1 (<= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse3 .cse4))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 2)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse2 (<= main_~x~0 2))) (or (and (= main_~q~0 2) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse0 .cse1 .cse2) (and (= main_~x~0 main_~r~0) .cse3 (= main_~b~0 0) (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) (= main_~q~0 0) .cse0 .cse1 .cse2) (and (< main_~r~0 main_~y~0) .cse3 (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse1 .cse2))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 2)) (.cse1 (<= 1 main_~y~0)) (.cse2 (= main_~b~0 (* main_~a~0 main_~y~0)))) (or (and .cse0 (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse1 .cse2) (and (= main_~x~0 main_~r~0) .cse0 (= main_~q~0 0) .cse1) (and (= main_~q~0 2) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse1 .cse2 (<= main_~x~0 2)))) [2022-04-28 04:50:12,491 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~y~0))) (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~y~0 2)) (.cse2 (<= (* 2 .cse8) main_~r~0)) (.cse3 (<= 1 main_~r~0)) (.cse4 (= main_~q~0 0)) (.cse5 (<= 1 main_~y~0)) (.cse6 (= main_~b~0 .cse8)) (.cse7 (<= main_~x~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= (mod main_~b~0 2) 0) .cse3 .cse4 .cse5 .cse6 .cse7)))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~y~0))) (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (<= main_~y~0 2)) (.cse2 (<= (* 2 .cse8) main_~r~0)) (.cse3 (<= 1 main_~r~0)) (.cse4 (= main_~q~0 0)) (.cse5 (<= 1 main_~y~0)) (.cse6 (= main_~b~0 .cse8)) (.cse7 (<= main_~x~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~b~0 main_~y~0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= (mod main_~b~0 2) 0) .cse3 .cse4 .cse5 .cse6 .cse7)))) [2022-04-28 04:50:12,491 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse5 (<= main_~y~0 2)) (.cse6 (<= 1 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= (* main_~y~0 2) main_~r~0) .cse1 (= main_~a~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse5 (= (mod main_~b~0 2) 0) .cse6 (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 (= main_~b~0 main_~y~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 04:50:12,492 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse5 (<= main_~y~0 2)) (.cse6 (<= 1 main_~r~0)) (.cse1 (= main_~q~0 0)) (.cse2 (<= 1 main_~y~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= (* main_~y~0 2) main_~r~0) .cse1 (= main_~a~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse5 (= (mod main_~b~0 2) 0) .cse6 (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 (= main_~b~0 main_~y~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-28 04:50:12,492 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 59) the Hoare annotation is: (let ((.cse0 (= main_~x~0 main_~r~0)) (.cse1 (< main_~r~0 (* main_~b~0 2))) (.cse2 (= main_~q~0 0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and .cse0 (<= main_~y~0 2) .cse1 (<= 1 main_~r~0) (= main_~b~0 main_~y~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= (* main_~y~0 2) main_~r~0) .cse2 (= main_~a~0 2) .cse3 .cse4))) [2022-04-28 04:50:12,492 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse3 (<= main_~y~0 2)) (.cse1 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse2 (<= main_~x~0 2))) (or (and (= main_~q~0 2) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse0 .cse1 .cse2) (and (= main_~x~0 main_~r~0) .cse3 (= main_~b~0 0) (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) (= main_~q~0 0) .cse0 .cse1 .cse2) (and (< main_~r~0 main_~y~0) .cse3 (<= 0 main_~x~0) (<= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse1 .cse2))) [2022-04-28 04:50:12,492 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse2 (<= 1 main_~y~0)) (.cse0 (<= main_~y~0 2)) (.cse1 (<= 0 main_~x~0)) (.cse3 (= main_~b~0 (* main_~a~0 main_~y~0))) (.cse4 (<= main_~x~0 2))) (or (and (= main_~x~0 main_~r~0) .cse0 .cse1 (= (mod main_~b~0 2) 0) (<= (div (* (- 1) main_~b~0) (- 4)) (div main_~r~0 4)) (= main_~q~0 0) .cse2 .cse3 .cse4) (and (= main_~q~0 2) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))) .cse2 .cse3 .cse4) (and (< main_~r~0 main_~y~0) .cse0 .cse1 (<= main_~b~0 main_~y~0) (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) .cse3 .cse4))) [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,492 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,492 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:50:12,493 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:50:12,493 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:50:12,493 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 04:50:12,493 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:50:12,493 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:50:12,493 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:50:12,496 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2] [2022-04-28 04:50:12,497 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:50:12,504 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:50:12,508 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:50:12,550 INFO L163 areAnnotationChecker]: CFG has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:50:12,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:50:12 BoogieIcfgContainer [2022-04-28 04:50:12,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:50:12,561 INFO L158 Benchmark]: Toolchain (without parser) took 95234.90ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 151.4MB in the beginning and 121.6MB in the end (delta: 29.8MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. [2022-04-28 04:50:12,561 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 168.1MB in the beginning and 168.0MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:50:12,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.85ms. Allocated memory is still 200.3MB. Free memory was 151.2MB in the beginning and 175.9MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:50:12,562 INFO L158 Benchmark]: Boogie Preprocessor took 24.63ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:50:12,562 INFO L158 Benchmark]: RCFGBuilder took 346.95ms. Allocated memory is still 200.3MB. Free memory was 174.4MB in the beginning and 161.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:50:12,562 INFO L158 Benchmark]: TraceAbstraction took 94616.14ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 161.3MB in the beginning and 121.6MB in the end (delta: 39.6MB). Peak memory consumption was 121.9MB. Max. memory is 8.0GB. [2022-04-28 04:50:12,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory was 168.1MB in the beginning and 168.0MB in the end (delta: 71.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.85ms. Allocated memory is still 200.3MB. Free memory was 151.2MB in the beginning and 175.9MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.63ms. Allocated memory is still 200.3MB. Free memory was 175.9MB in the beginning and 174.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 346.95ms. Allocated memory is still 200.3MB. Free memory was 174.4MB in the beginning and 161.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 94616.14ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 161.3MB in the beginning and 121.6MB in the end (delta: 39.6MB). Peak memory consumption was 121.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 94.5s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 1471 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1068 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1515 IncrementalHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 403 mSDtfsCounter, 1515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 796 SyntacticMatches, 6 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 397 PreInvPairs, 514 NumberOfFragments, 1192 HoareAnnotationTreeSize, 397 FomulaSimplifications, 131 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 39 FomulaSimplificationsInter, 1318 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((x == r && y * 2 <= r) && q == 0) && a == 2) && 1 <= y) && b == a * y) && x <= 2) || ((((((((x == r && y <= 2) && b % 2 == 0) && 1 <= r) && -1 * b / -4 <= r / 4) && q == 0) && 1 <= y) && b == a * y) && x <= 2)) || (((((((x == r && y <= 2) && 1 <= r) && b == y) && q == 0) && 1 <= y) && b == a * y) && x <= 2) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((q == 2 && 0 <= r) && x == r + y * 2) && 1 <= y) && b == a * y) && x <= 2) || (((((((x == r && y <= 2) && b == 0) && -1 * b / -4 <= r / 4) && q == 0) && 1 <= y) && b == a * y) && x <= 2)) || (((((((r < y && y <= 2) && 0 <= x) && b <= y) && x == y + r) && q == 1) && b == a * y) && x <= 2) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 04:50:12,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...