/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:27:44,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:27:44,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:27:44,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:27:44,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:27:44,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:27:44,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:27:44,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:27:44,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:27:44,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:27:44,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:27:44,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:27:44,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:27:44,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:27:44,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:27:44,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:27:44,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:27:44,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:27:44,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:27:44,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:27:44,840 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:27:44,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:27:44,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:27:44,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:27:44,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:27:44,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:27:44,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:27:44,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:27:44,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:27:44,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:27:44,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:27:44,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:27:44,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:27:44,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:27:44,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:27:44,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:27:44,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:27:44,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:27:44,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:27:44,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:27:44,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:27:44,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:27:44,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:27:44,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:27:44,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:27:44,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:27:44,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:27:44,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:27:44,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:27:44,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:27:44,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:27:44,860 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:27:44,860 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:27:44,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:27:44,860 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:27:44,860 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 11:27:45,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:27:45,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:27:45,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:27:45,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:27:45,056 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:27:45,057 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 11:27:45,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7653c81d8/6c6ba4f0391847ecad42b3a94c298e4c/FLAGca696cb4d [2022-04-28 11:27:45,468 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:27:45,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_valuebound2.c [2022-04-28 11:27:45,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7653c81d8/6c6ba4f0391847ecad42b3a94c298e4c/FLAGca696cb4d [2022-04-28 11:27:45,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7653c81d8/6c6ba4f0391847ecad42b3a94c298e4c [2022-04-28 11:27:45,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:27:45,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:27:45,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:27:45,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:27:45,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:27:45,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1538b5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45, skipping insertion in model container [2022-04-28 11:27:45,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:27:45,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:27:45,638 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 11:27:45,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:27:45,656 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:27:45,663 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 11:27:45,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:27:45,677 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:27:45,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45 WrapperNode [2022-04-28 11:27:45,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:27:45,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:27:45,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:27:45,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:27:45,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:27:45,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:27:45,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:27:45,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:27:45,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (1/1) ... [2022-04-28 11:27:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:27:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:45,720 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 11:27:45,728 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 11:27:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:27:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:27:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:27:45,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:27:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:27:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:27:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:27:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:27:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:27:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:27:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:27:45,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:27:45,790 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:27:45,791 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:27:45,937 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:27:45,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:27:45,942 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 11:27:45,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:27:45 BoogieIcfgContainer [2022-04-28 11:27:45,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:27:45,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:27:45,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:27:45,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:27:45,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:27:45" (1/3) ... [2022-04-28 11:27:45,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642997ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:27:45, skipping insertion in model container [2022-04-28 11:27:45,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:27:45" (2/3) ... [2022-04-28 11:27:45,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642997ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:27:45, skipping insertion in model container [2022-04-28 11:27:45,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:27:45" (3/3) ... [2022-04-28 11:27:45,949 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound2.c [2022-04-28 11:27:45,959 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:27:45,959 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:27:45,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:27:45,992 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@56899b43, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41cbbc2 [2022-04-28 11:27:45,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:27:45,997 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 11:27:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 11:27:46,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:46,003 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 11:27:46,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:46,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 1 times [2022-04-28 11:27:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:46,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679326171] [2022-04-28 11:27:46,018 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1768835633, now seen corresponding path program 2 times [2022-04-28 11:27:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:46,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410279879] [2022-04-28 11:27:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:27:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,145 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 11:27:46,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 11:27:46,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 11:27:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:27:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 11:27:46,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 11:27:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 11:27:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 11:27:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 11:27:46,166 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 11:27:46,167 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 11:27:46,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 11:27:46,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-28 11:27:46,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret6 := main(); {42#true} is VALID [2022-04-28 11:27:46,168 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 11:27:46,168 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 11:27:46,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-28 11:27:46,169 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 11:27:46,169 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 11:27:46,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,171 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-28 11:27:46,171 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 11:27:46,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 11:27:46,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 11:27:46,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 11:27:46,172 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-28 11:27:46,172 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 11:27:46,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#false} assume false; {43#false} is VALID [2022-04-28 11:27:46,173 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 11:27:46,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 11:27:46,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 11:27:46,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 11:27:46,174 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 11:27:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:46,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410279879] [2022-04-28 11:27:46,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410279879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:46,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:46,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:27:46,177 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:46,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679326171] [2022-04-28 11:27:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679326171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:46,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:46,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:27:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517944377] [2022-04-28 11:27:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:46,181 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 11:27:46,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:46,185 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 11:27:46,214 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 11:27:46,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:27:46,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:46,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:27:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:27:46,229 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 11:27:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:46,398 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2022-04-28 11:27:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:27:46,399 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 11:27:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:46,400 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 11:27:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 11:27:46,412 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 11:27:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-28 11:27:46,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-28 11:27:46,556 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 11:27:46,562 INFO L225 Difference]: With dead ends: 71 [2022-04-28 11:27:46,562 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 11:27:46,564 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 11:27:46,567 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 11:27:46,567 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 11:27:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 11:27:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 11:27:46,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:46,591 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 11:27:46,592 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 11:27:46,592 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 11:27:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:46,596 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:27:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:27:46,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:46,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:46,597 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 11:27:46,598 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 11:27:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:46,601 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 11:27:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:27:46,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:46,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:46,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:46,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:46,602 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 11:27:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 11:27:46,605 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 28 [2022-04-28 11:27:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:46,606 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 11:27:46,606 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 11:27:46,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 11:27:46,648 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 11:27:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 11:27:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 11:27:46,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:46,650 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 11:27:46,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:27:46,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 1 times [2022-04-28 11:27:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898930661] [2022-04-28 11:27:46,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1378913883, now seen corresponding path program 2 times [2022-04-28 11:27:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:46,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880984889] [2022-04-28 11:27:46,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:46,694 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:46,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010020352] [2022-04-28 11:27:46,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:46,695 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 11:27:46,719 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 11:27:46,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 11:27:46,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:46,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:27:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:46,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:50,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-28 11:27:50,170 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 11:27:50,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:27:50,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #98#return; {340#true} is VALID [2022-04-28 11:27:50,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret6 := main(); {340#true} is VALID [2022-04-28 11:27:50,171 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 11:27:50,171 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 11:27:50,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:27:50,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:27:50,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:27:50,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#true} {340#true} #78#return; {340#true} is VALID [2022-04-28 11:27:50,172 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 11:27:50,172 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 11:27:50,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:27:50,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:27:50,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:27:50,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {340#true} {340#true} #80#return; {340#true} is VALID [2022-04-28 11:27:50,173 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 11:27:50,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#true} ~cond := #in~cond; {340#true} is VALID [2022-04-28 11:27:50,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {340#true} assume !(0 == ~cond); {340#true} is VALID [2022-04-28 11:27:50,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-28 11:27:50,174 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {340#true} {340#true} #82#return; {340#true} is VALID [2022-04-28 11:27:50,187 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 11:27:50,188 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 11:27:50,189 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 11:27:50,190 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 11:27:50,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-28 11:27:50,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-28 11:27:50,191 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 11:27:50,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:27:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:50,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880984889] [2022-04-28 11:27:50,191 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:50,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010020352] [2022-04-28 11:27:50,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010020352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:50,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:50,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:27:50,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898930661] [2022-04-28 11:27:50,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898930661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:27:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822233044] [2022-04-28 11:27:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:50,194 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 11:27:50,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:50,194 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 11:27:50,213 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 11:27:50,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:27:50,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:27:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:27:50,217 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 11:27:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:50,374 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 11:27:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:27:50,375 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 11:27:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:50,375 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 11:27:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:27:50,410 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 11:27:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-28 11:27:50,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-28 11:27:50,447 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 11:27:50,450 INFO L225 Difference]: With dead ends: 45 [2022-04-28 11:27:50,450 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 11:27:50,450 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 11:27:50,451 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 11:27:50,451 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 11:27:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 11:27:50,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-28 11:27:50,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:50,461 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 11:27:50,462 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 11:27:50,462 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 11:27:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:50,465 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:27:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:27:50,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:50,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:50,466 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 11:27:50,466 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 11:27:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:50,468 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-28 11:27:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 11:27:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:50,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:50,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:50,470 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 11:27:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-28 11:27:50,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 28 [2022-04-28 11:27:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:50,472 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-28 11:27:50,472 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 11:27:50,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-28 11:27:50,512 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 11:27:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-28 11:27:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 11:27:50,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:50,513 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 11:27:50,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:27:50,727 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 11:27:50,728 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 1 times [2022-04-28 11:27:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:50,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113850048] [2022-04-28 11:27:50,729 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:50,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1928335320, now seen corresponding path program 2 times [2022-04-28 11:27:50,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:50,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972620585] [2022-04-28 11:27:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:50,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:50,759 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:50,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1372951870] [2022-04-28 11:27:50,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:50,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:50,772 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 11:27:50,773 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 11:27:50,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:27:50,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:50,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 11:27:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:50,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:51,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {686#true} call ULTIMATE.init(); {686#true} is VALID [2022-04-28 11:27:51,050 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 11:27:51,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:27:51,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {686#true} {686#true} #98#return; {686#true} is VALID [2022-04-28 11:27:51,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {686#true} call #t~ret6 := main(); {686#true} is VALID [2022-04-28 11:27:51,051 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 11:27:51,052 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 11:27:51,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 11:27:51,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 11:27:51,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:27:51,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {686#true} {686#true} #78#return; {686#true} is VALID [2022-04-28 11:27:51,053 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 11:27:51,053 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 11:27:51,053 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 11:27:51,054 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 11:27:51,054 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 11:27:51,055 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 11:27:51,055 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 11:27:51,056 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 11:27:51,056 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 11:27:51,057 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 11:27:51,058 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 11:27:51,058 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 11:27:51,059 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 11:27:51,059 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 11:27:51,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#true} ~cond := #in~cond; {686#true} is VALID [2022-04-28 11:27:51,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {686#true} assume !(0 == ~cond); {686#true} is VALID [2022-04-28 11:27:51,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {686#true} assume true; {686#true} is VALID [2022-04-28 11:27:51,060 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 11:27:51,061 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 11:27:51,062 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 11:27:51,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {687#false} is VALID [2022-04-28 11:27:51,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#false} assume !false; {687#false} is VALID [2022-04-28 11:27:51,063 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 11:27:51,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:27:51,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:51,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972620585] [2022-04-28 11:27:51,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:51,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372951870] [2022-04-28 11:27:51,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372951870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:51,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:51,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:27:51,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:51,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113850048] [2022-04-28 11:27:51,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113850048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:51,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:51,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:27:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024697521] [2022-04-28 11:27:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:51,066 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 11:27:51,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:51,066 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 11:27:51,087 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 11:27:51,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:27:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:27:51,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:27:51,088 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 11:27:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:51,498 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-28 11:27:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:27:51,498 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 11:27:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:51,499 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 11:27:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 11:27:51,501 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 11:27:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 11:27:51,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 11:27:51,564 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 11:27:51,566 INFO L225 Difference]: With dead ends: 57 [2022-04-28 11:27:51,566 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:27:51,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:27:51,567 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:51,567 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.1s Time] [2022-04-28 11:27:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:27:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-04-28 11:27:51,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:51,613 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 11:27:51,613 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 11:27:51,614 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 11:27:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:51,616 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 11:27:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 11:27:51,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:51,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:51,617 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 11:27:51,617 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 11:27:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:51,620 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-04-28 11:27:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 11:27:51,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:51,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:51,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:51,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:51,621 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 11:27:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 11:27:51,623 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 33 [2022-04-28 11:27:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:51,623 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-28 11:27:51,623 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 11:27:51,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 11:27:51,686 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 11:27:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 11:27:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 11:27:51,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:51,687 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 11:27:51,724 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 11:27:51,888 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 11:27:51,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 1 times [2022-04-28 11:27:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:51,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838236855] [2022-04-28 11:27:51,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:51,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1297647068, now seen corresponding path program 2 times [2022-04-28 11:27:51,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:51,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996606874] [2022-04-28 11:27:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:51,902 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:51,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202318816] [2022-04-28 11:27:51,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:51,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:51,903 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 11:27:51,904 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 11:27:51,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:27:51,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:51,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:27:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:51,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:52,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 11:27:52,882 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 11:27:52,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:52,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 11:27:52,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 11:27:52,883 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 11:27:52,883 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 11:27:52,883 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 11:27:52,884 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 11:27:52,884 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 11:27:52,887 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 11:27:52,888 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 11:27:52,889 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 11:27:52,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:52,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:52,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:52,890 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 11:27:52,890 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 11:27:52,893 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 11:27:52,893 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 11:27:52,893 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 11:27:52,894 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 11:27:52,904 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 11:27:52,904 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 11:27:52,904 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 11:27:52,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:52,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:52,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:52,905 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 11:27:52,905 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 11:27:52,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1225#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:52,906 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 11:27:52,906 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 11:27:52,907 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 11:27:52,908 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 11:27:52,912 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 11:27:52,912 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 11:27:52,913 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 11:27:52,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {1251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 11:27:52,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 11:27:52,913 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 11:27:52,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:27:55,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2022-04-28 11:27:55,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {1251#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1126#false} is VALID [2022-04-28 11:27:55,671 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 11:27:55,672 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 11:27:55,672 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 11:27:55,672 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 11:27:55,672 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1125#true} {1125#true} #86#return; {1125#true} is VALID [2022-04-28 11:27:55,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:55,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:55,673 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 11:27:55,673 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1125#true} {1125#true} #84#return; {1125#true} is VALID [2022-04-28 11:27:55,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:55,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:55,674 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 11:27:55,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {1125#true} assume !false; {1125#true} is VALID [2022-04-28 11:27:55,674 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 11:27:55,674 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1125#true} {1125#true} #82#return; {1125#true} is VALID [2022-04-28 11:27:55,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:55,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:55,674 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 11:27:55,674 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1125#true} {1125#true} #80#return; {1125#true} is VALID [2022-04-28 11:27:55,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:55,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:55,681 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 11:27:55,681 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 11:27:55,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1125#true} {1125#true} #78#return; {1125#true} is VALID [2022-04-28 11:27:55,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#true} assume !(0 == ~cond); {1125#true} is VALID [2022-04-28 11:27:55,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#true} ~cond := #in~cond; {1125#true} is VALID [2022-04-28 11:27:55,681 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 11:27:55,681 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 11:27:55,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret6 := main(); {1125#true} is VALID [2022-04-28 11:27:55,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #98#return; {1125#true} is VALID [2022-04-28 11:27:55,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2022-04-28 11:27:55,682 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 11:27:55,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2022-04-28 11:27:55,682 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 11:27:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996606874] [2022-04-28 11:27:55,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202318816] [2022-04-28 11:27:55,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202318816] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 11:27:55,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:27:55,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 14 [2022-04-28 11:27:55,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:55,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838236855] [2022-04-28 11:27:55,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838236855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:55,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:55,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:27:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533067338] [2022-04-28 11:27:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:55,683 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 11:27:55,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:55,684 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 11:27:55,707 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 11:27:55,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:27:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:27:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:27:55,709 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 11:27:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:55,896 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-28 11:27:55,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:27:55,896 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 11:27:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:55,896 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 11:27:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:27:55,897 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 11:27:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 11:27:55,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 11:27:55,933 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 11:27:55,934 INFO L225 Difference]: With dead ends: 59 [2022-04-28 11:27:55,934 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 11:27:55,935 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 11:27:55,935 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:27:55,936 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.0s Time] [2022-04-28 11:27:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 11:27:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 11:27:55,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:55,974 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 11:27:55,974 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 11:27:55,974 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 11:27:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:55,979 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 11:27:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:27:55,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:55,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:55,980 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 11:27:55,981 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 11:27:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:55,984 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-28 11:27:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:27:55,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:55,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:55,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:55,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:55,986 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 11:27:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-04-28 11:27:55,990 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 40 [2022-04-28 11:27:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:55,990 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-04-28 11:27:55,990 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 11:27:55,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 70 transitions. [2022-04-28 11:27:56,083 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 11:27:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-04-28 11:27:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 11:27:56,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:56,084 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 11:27:56,102 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 11:27:56,299 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 11:27:56,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 1 times [2022-04-28 11:27:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:56,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [702778220] [2022-04-28 11:27:56,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash -391974204, now seen corresponding path program 2 times [2022-04-28 11:27:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:56,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895337550] [2022-04-28 11:27:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:56,317 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:56,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [828448193] [2022-04-28 11:27:56,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:56,319 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 11:27:56,319 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 11:27:56,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:27:56,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:56,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:27:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:56,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:56,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {1726#true} call ULTIMATE.init(); {1726#true} is VALID [2022-04-28 11:27:56,555 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 11:27:56,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1726#true} {1726#true} #98#return; {1726#true} is VALID [2022-04-28 11:27:56,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {1726#true} call #t~ret6 := main(); {1726#true} is VALID [2022-04-28 11:27:56,555 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 11:27:56,555 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 11:27:56,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1726#true} {1726#true} #78#return; {1726#true} is VALID [2022-04-28 11:27:56,556 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 11:27:56,556 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 11:27:56,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1726#true} {1726#true} #80#return; {1726#true} is VALID [2022-04-28 11:27:56,556 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 11:27:56,556 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 11:27:56,557 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 11:27:56,558 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 11:27:56,558 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 11:27:56,559 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 11:27:56,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {1796#(<= 1 main_~y~0)} assume !false; {1796#(<= 1 main_~y~0)} is VALID [2022-04-28 11:27:56,559 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 11:27:56,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,560 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 11:27:56,560 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 11:27:56,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,561 INFO L290 TraceCheckUtils]: 32: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,561 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 11:27:56,562 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 11:27:56,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {1836#(<= 1 main_~r~0)} assume !false; {1836#(<= 1 main_~r~0)} is VALID [2022-04-28 11:27:56,562 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 11:27:56,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,563 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 11:27:56,563 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 11:27:56,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {1726#true} ~cond := #in~cond; {1726#true} is VALID [2022-04-28 11:27:56,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {1726#true} assume !(0 == ~cond); {1726#true} is VALID [2022-04-28 11:27:56,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {1726#true} assume true; {1726#true} is VALID [2022-04-28 11:27:56,563 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 11:27:56,564 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 11:27:56,564 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 11:27:56,565 INFO L290 TraceCheckUtils]: 48: Hoare triple {1877#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1727#false} is VALID [2022-04-28 11:27:56,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {1727#false} assume !false; {1727#false} is VALID [2022-04-28 11:27:56,565 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 11:27:56,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:27:56,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:27:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895337550] [2022-04-28 11:27:56,565 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:27:56,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828448193] [2022-04-28 11:27:56,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828448193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:56,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:56,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:27:56,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:27:56,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [702778220] [2022-04-28 11:27:56,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [702778220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:27:56,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:27:56,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:27:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913513742] [2022-04-28 11:27:56,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:27:56,566 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 11:27:56,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:27:56,567 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 11:27:56,596 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 11:27:56,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:27:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:56,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:27:56,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:27:56,597 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 11:27:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:56,890 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 11:27:56,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:27:56,890 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 11:27:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:27:56,890 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 11:27:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:27:56,892 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 11:27:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:27:56,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 11:27:56,925 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 11:27:56,926 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:27:56,926 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 11:27:56,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:27:56,927 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 11:27:56,927 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 11:27:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 11:27:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 11:27:56,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:27:56,972 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 11:27:56,972 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 11:27:56,972 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 11:27:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:56,974 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 11:27:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:27:56,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:56,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:56,974 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 11:27:56,975 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 11:27:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:27:56,976 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-28 11:27:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:27:56,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:27:56,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:27:56,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:27:56,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:27:56,977 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 11:27:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-04-28 11:27:56,978 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 50 [2022-04-28 11:27:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:27:56,978 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-04-28 11:27:56,979 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 11:27:56,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 73 transitions. [2022-04-28 11:27:57,044 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 11:27:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-28 11:27:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 11:27:57,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:27:57,045 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 11:27:57,063 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 11:27:57,261 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 11:27:57,261 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:27:57,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:27:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 1 times [2022-04-28 11:27:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:27:57,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2109468021] [2022-04-28 11:27:57,262 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:27:57,262 INFO L85 PathProgramCache]: Analyzing trace with hash 991781023, now seen corresponding path program 2 times [2022-04-28 11:27:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:27:57,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643743535] [2022-04-28 11:27:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:27:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:27:57,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:27:57,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1135519915] [2022-04-28 11:27:57,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:27:57,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:27:57,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:27:57,284 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 11:27:57,285 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 11:27:57,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:27:57,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:27:57,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:27:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:27:57,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:27:57,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 11:27:57,484 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 11:27:57,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #98#return; {2259#true} is VALID [2022-04-28 11:27:57,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret6 := main(); {2259#true} is VALID [2022-04-28 11:27:57,485 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 11:27:57,485 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 11:27:57,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#true} {2259#true} #78#return; {2259#true} is VALID [2022-04-28 11:27:57,485 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 11:27:57,485 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 11:27:57,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2259#true} {2259#true} #80#return; {2259#true} is VALID [2022-04-28 11:27:57,486 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 11:27:57,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2259#true} {2259#true} #82#return; {2259#true} is VALID [2022-04-28 11:27:57,486 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 11:27:57,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 11:27:57,486 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 11:27:57,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,486 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2259#true} {2259#true} #84#return; {2259#true} is VALID [2022-04-28 11:27:57,487 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 11:27:57,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,487 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2259#true} {2259#true} #86#return; {2259#true} is VALID [2022-04-28 11:27:57,487 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 11:27:57,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 11:27:57,487 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 11:27:57,491 INFO L290 TraceCheckUtils]: 37: Hoare triple {2259#true} ~cond := #in~cond; {2375#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:27:57,491 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 11:27:57,491 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 11:27:57,492 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 11:27:57,492 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 11:27:57,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,493 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 11:27:57,493 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 11:27:57,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:27:57,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:27:57,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:27:57,494 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 11:27:57,494 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 11:27:57,495 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 11:27:57,495 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 11:27:57,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {2428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 11:27:57,496 INFO L290 TraceCheckUtils]: 55: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 11:27:57,496 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 11:27:57,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:28:01,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {2260#false} assume !false; {2260#false} is VALID [2022-04-28 11:28:01,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {2428#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2260#false} is VALID [2022-04-28 11:28:01,829 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 11:28:01,829 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 11:28:01,830 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 11:28:01,831 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 11:28:01,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,831 INFO L290 TraceCheckUtils]: 47: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,831 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 11:28:01,832 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 11:28:01,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,832 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 11:28:01,833 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 11:28:01,833 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 11:28:01,833 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 11:28:01,834 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 11:28:01,834 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 11:28:01,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 11:28:01,834 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 11:28:01,834 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2259#true} {2259#true} #86#return; {2259#true} is VALID [2022-04-28 11:28:01,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,834 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 11:28:01,834 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2259#true} {2259#true} #84#return; {2259#true} is VALID [2022-04-28 11:28:01,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,835 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 11:28:01,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {2259#true} assume !false; {2259#true} is VALID [2022-04-28 11:28:01,835 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 11:28:01,835 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2259#true} {2259#true} #82#return; {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,835 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 11:28:01,835 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2259#true} {2259#true} #80#return; {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,835 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 11:28:01,836 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 11:28:01,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2259#true} {2259#true} #78#return; {2259#true} is VALID [2022-04-28 11:28:01,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {2259#true} assume !(0 == ~cond); {2259#true} is VALID [2022-04-28 11:28:01,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {2259#true} ~cond := #in~cond; {2259#true} is VALID [2022-04-28 11:28:01,836 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 11:28:01,836 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 11:28:01,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {2259#true} call #t~ret6 := main(); {2259#true} is VALID [2022-04-28 11:28:01,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2259#true} {2259#true} #98#return; {2259#true} is VALID [2022-04-28 11:28:01,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2259#true} assume true; {2259#true} is VALID [2022-04-28 11:28:01,836 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 11:28:01,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {2259#true} call ULTIMATE.init(); {2259#true} is VALID [2022-04-28 11:28:01,837 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 11:28:01,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:28:01,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643743535] [2022-04-28 11:28:01,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:28:01,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135519915] [2022-04-28 11:28:01,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135519915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:28:01,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:28:01,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 11:28:01,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:28:01,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2109468021] [2022-04-28 11:28:01,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2109468021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:01,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:01,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:28:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140146008] [2022-04-28 11:28:01,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:28:01,838 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 11:28:01,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:28:01,838 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 11:28:01,867 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 11:28:01,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:28:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:28:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:28:01,868 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 11:28:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:02,183 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 11:28:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:28:02,184 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 11:28:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:28:02,184 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 11:28:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:28:02,185 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 11:28:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 11:28:02,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 11:28:02,225 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 11:28:02,227 INFO L225 Difference]: With dead ends: 67 [2022-04-28 11:28:02,227 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 11:28:02,227 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 11:28:02,228 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 11:28:02,228 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 11:28:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 11:28:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 11:28:02,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:28:02,276 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 11:28:02,276 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 11:28:02,276 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 11:28:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:02,278 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 11:28:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:28:02,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:02,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:02,278 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 11:28:02,278 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 11:28:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:02,280 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-28 11:28:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:28:02,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:02,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:02,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:28:02,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:28:02,281 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 11:28:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-28 11:28:02,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 56 [2022-04-28 11:28:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:28:02,283 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-28 11:28:02,283 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 11:28:02,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-28 11:28:02,354 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 11:28:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-28 11:28:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 11:28:02,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:28:02,355 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 11:28:02,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 11:28:02,555 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 11:28:02,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:28:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:28:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 1 times [2022-04-28 11:28:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1247117872] [2022-04-28 11:28:02,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:28:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2096667334, now seen corresponding path program 2 times [2022-04-28 11:28:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482218391] [2022-04-28 11:28:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:02,567 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667054527] [2022-04-28 11:28:02,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:28:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:02,569 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 11:28:02,577 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 11:28:02,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:28:02,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:02,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:28:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:28:02,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {3004#true} call ULTIMATE.init(); {3004#true} is VALID [2022-04-28 11:28:02,863 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 11:28:02,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3004#true} {3004#true} #98#return; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3004#true} call #t~ret6 := main(); {3004#true} is VALID [2022-04-28 11:28:02,864 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 11:28:02,864 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 11:28:02,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3004#true} {3004#true} #78#return; {3004#true} is VALID [2022-04-28 11:28:02,864 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 11:28:02,864 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 11:28:02,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,864 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3004#true} {3004#true} #80#return; {3004#true} is VALID [2022-04-28 11:28:02,865 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 11:28:02,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,865 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3004#true} {3004#true} #82#return; {3004#true} is VALID [2022-04-28 11:28:02,865 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 11:28:02,866 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 11:28:02,866 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 11:28:02,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,867 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 11:28:02,867 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 11:28:02,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,867 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 11:28:02,868 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 11:28:02,868 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 11:28:02,868 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 11:28:02,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,869 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 11:28:02,869 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 11:28:02,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,870 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 11:28:02,870 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 11:28:02,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,871 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 11:28:02,871 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 11:28:02,872 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 11:28:02,872 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 11:28:02,872 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 11:28:02,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:02,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:02,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:02,873 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 11:28:02,874 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 11:28:02,874 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 11:28:02,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3005#false} is VALID [2022-04-28 11:28:02,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-04-28 11:28:02,874 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 11:28:02,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:28:22,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-04-28 11:28:22,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {3193#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3005#false} is VALID [2022-04-28 11:28:22,102 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 11:28:22,103 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 11:28:22,103 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 11:28:22,104 INFO L290 TraceCheckUtils]: 57: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,104 INFO L290 TraceCheckUtils]: 55: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,104 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 11:28:22,104 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 11:28:22,116 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 11:28:22,116 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 11:28:22,117 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 11:28:22,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,117 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 11:28:22,118 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 11:28:22,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,118 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 11:28:22,119 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 11:28:22,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,119 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 11:28:22,119 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 11:28:22,120 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 11:28:22,120 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 11:28:22,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,121 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 11:28:22,121 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 11:28:22,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,122 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 11:28:22,122 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 11:28:22,122 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 11:28:22,122 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3004#true} {3004#true} #82#return; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,123 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 11:28:22,123 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3004#true} {3004#true} #80#return; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,123 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 11:28:22,123 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 11:28:22,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3004#true} {3004#true} #78#return; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {3004#true} assume !(0 == ~cond); {3004#true} is VALID [2022-04-28 11:28:22,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {3004#true} ~cond := #in~cond; {3004#true} is VALID [2022-04-28 11:28:22,123 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 11:28:22,124 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 11:28:22,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {3004#true} call #t~ret6 := main(); {3004#true} is VALID [2022-04-28 11:28:22,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3004#true} {3004#true} #98#return; {3004#true} is VALID [2022-04-28 11:28:22,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {3004#true} assume true; {3004#true} is VALID [2022-04-28 11:28:22,124 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 11:28:22,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {3004#true} call ULTIMATE.init(); {3004#true} is VALID [2022-04-28 11:28:22,124 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 11:28:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:28:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482218391] [2022-04-28 11:28:22,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:28:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667054527] [2022-04-28 11:28:22,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667054527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:28:22,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:28:22,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:28:22,139 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:28:22,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1247117872] [2022-04-28 11:28:22,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1247117872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:22,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:22,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:28:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179503257] [2022-04-28 11:28:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:28:22,142 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 11:28:22,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:28:22,143 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 11:28:22,180 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 11:28:22,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:28:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:22,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:28:22,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:28:22,181 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 11:28:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:22,605 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 11:28:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:28:22,606 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 11:28:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:28:22,606 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 11:28:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 11:28:22,608 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 11:28:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 11:28:22,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 11:28:22,679 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 11:28:22,680 INFO L225 Difference]: With dead ends: 97 [2022-04-28 11:28:22,680 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 11:28:22,681 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 11:28:22,681 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:28:22,681 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.1s Time] [2022-04-28 11:28:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 11:28:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-04-28 11:28:22,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:28:22,769 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 11:28:22,770 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 11:28:22,770 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 11:28:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:22,772 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 11:28:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 11:28:22,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:22,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:22,773 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 11:28:22,773 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 11:28:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:22,775 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-28 11:28:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-04-28 11:28:22,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:22,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:22,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:28:22,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:28:22,776 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 11:28:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-04-28 11:28:22,778 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 63 [2022-04-28 11:28:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:28:22,778 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-04-28 11:28:22,779 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 11:28:22,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 110 transitions. [2022-04-28 11:28:22,882 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 11:28:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-04-28 11:28:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:28:22,883 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:28:22,883 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 11:28:22,901 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 11:28:23,083 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 11:28:23,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:28:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:28:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 1 times [2022-04-28 11:28:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966686769] [2022-04-28 11:28:23,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:28:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2105983492, now seen corresponding path program 2 times [2022-04-28 11:28:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:28:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551681896] [2022-04-28 11:28:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:28:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:28:23,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:28:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026207277] [2022-04-28 11:28:23,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:28:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:28:23,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:28:23,100 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 11:28:23,101 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 11:28:23,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:28:23,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:28:23,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 11:28:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:28:23,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:28:24,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {3954#true} call ULTIMATE.init(); {3954#true} is VALID [2022-04-28 11:28:24,022 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 11:28:24,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3954#true} {3954#true} #98#return; {3954#true} is VALID [2022-04-28 11:28:24,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {3954#true} call #t~ret6 := main(); {3954#true} is VALID [2022-04-28 11:28:24,022 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 11:28:24,022 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 11:28:24,023 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 11:28:24,023 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 11:28:24,023 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 11:28:24,024 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 11:28:24,024 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 11:28:24,024 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 11:28:24,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,025 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 11:28:24,025 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 11:28:24,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,025 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 11:28:24,026 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 11:28:24,026 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 11:28:24,026 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 11:28:24,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,027 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 11:28:24,027 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 11:28:24,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,030 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 11:28:24,032 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 11:28:24,032 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 11:28:24,032 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 11:28:24,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {3954#true} ~cond := #in~cond; {4075#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:28:24,035 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 11:28:24,039 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 11:28:24,040 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 11:28:24,040 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 11:28:24,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,041 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 11:28:24,041 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 11:28:24,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,041 INFO L290 TraceCheckUtils]: 49: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,041 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 11:28:24,042 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 11:28:24,042 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 11:28:24,042 INFO L290 TraceCheckUtils]: 53: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,042 INFO L290 TraceCheckUtils]: 54: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,042 INFO L290 TraceCheckUtils]: 55: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,042 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 11:28:24,043 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 11:28:24,043 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 11:28:24,043 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 11:28:24,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,044 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 11:28:24,044 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 11:28:24,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,045 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 11:28:24,045 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 11:28:24,045 INFO L290 TraceCheckUtils]: 70: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,045 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 11:28:24,046 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 11:28:24,047 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 11:28:24,047 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 11:28:24,047 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 11:28:24,047 INFO L290 TraceCheckUtils]: 78: Hoare triple {3954#true} ~cond := #in~cond; {3954#true} is VALID [2022-04-28 11:28:24,047 INFO L290 TraceCheckUtils]: 79: Hoare triple {3954#true} assume !(0 == ~cond); {3954#true} is VALID [2022-04-28 11:28:24,047 INFO L290 TraceCheckUtils]: 80: Hoare triple {3954#true} assume true; {3954#true} is VALID [2022-04-28 11:28:24,048 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 11:28:24,048 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 11:28:24,049 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 11:28:24,049 INFO L290 TraceCheckUtils]: 84: Hoare triple {4220#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3955#false} is VALID [2022-04-28 11:28:24,049 INFO L290 TraceCheckUtils]: 85: Hoare triple {3955#false} assume !false; {3955#false} is VALID [2022-04-28 11:28:24,049 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 11:28:24,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:29:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:07,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551681896] [2022-04-28 11:29:07,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026207277] [2022-04-28 11:29:07,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026207277] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:29:07,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:29:07,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-04-28 11:29:07,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966686769] [2022-04-28 11:29:07,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966686769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:07,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:07,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:29:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797045201] [2022-04-28 11:29:07,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:07,780 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 11:29:07,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:07,780 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 11:29:07,824 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 11:29:07,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:29:07,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:07,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:29:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=405, Unknown=1, NotChecked=0, Total=506 [2022-04-28 11:29:07,825 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 11:29:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:09,370 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2022-04-28 11:29:09,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:29:09,370 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 11:29:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:09,370 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 11:29:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-28 11:29:09,372 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 11:29:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 126 transitions. [2022-04-28 11:29:09,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 126 transitions. [2022-04-28 11:29:09,481 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 11:29:09,483 INFO L225 Difference]: With dead ends: 153 [2022-04-28 11:29:09,483 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 11:29:09,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=532, Unknown=1, NotChecked=0, Total=650 [2022-04-28 11:29:09,484 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 37 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:29:09,484 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.6s Time] [2022-04-28 11:29:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 11:29:09,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 11:29:09,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:09,634 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 11:29:09,634 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 11:29:09,635 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 11:29:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:09,645 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-04-28 11:29:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-04-28 11:29:09,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:09,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:09,646 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 11:29:09,646 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 11:29:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:09,651 INFO L93 Difference]: Finished difference Result 112 states and 134 transitions. [2022-04-28 11:29:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2022-04-28 11:29:09,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:09,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:09,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:09,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:09,652 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 11:29:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2022-04-28 11:29:09,654 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 86 [2022-04-28 11:29:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:09,654 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2022-04-28 11:29:09,654 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 11:29:09,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 130 transitions. [2022-04-28 11:29:09,780 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 11:29:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2022-04-28 11:29:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 11:29:09,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:29:09,781 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 11:29:09,797 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 11:29:09,990 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 11:29:09,990 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:29:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:29:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash -895340852, now seen corresponding path program 3 times [2022-04-28 11:29:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:09,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1504816937] [2022-04-28 11:29:09,991 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:29:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash -895340852, now seen corresponding path program 4 times [2022-04-28 11:29:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:29:09,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073417955] [2022-04-28 11:29:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:29:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:29:10,003 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:29:10,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457279375] [2022-04-28 11:29:10,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:29:10,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:29:10,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:29:10,004 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 11:29:10,005 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 11:29:10,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:29:10,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:29:10,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 11:29:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:29:10,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:29:10,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {5147#true} call ULTIMATE.init(); {5147#true} is VALID [2022-04-28 11:29:10,236 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 11:29:10,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5147#true} {5147#true} #98#return; {5147#true} is VALID [2022-04-28 11:29:10,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {5147#true} call #t~ret6 := main(); {5147#true} is VALID [2022-04-28 11:29:10,236 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 11:29:10,236 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 11:29:10,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5147#true} {5147#true} #78#return; {5147#true} is VALID [2022-04-28 11:29:10,237 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 11:29:10,237 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 11:29:10,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5147#true} {5147#true} #80#return; {5147#true} is VALID [2022-04-28 11:29:10,237 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 11:29:10,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5147#true} {5147#true} #82#return; {5147#true} is VALID [2022-04-28 11:29:10,237 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 11:29:10,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {5147#true} assume !false; {5147#true} is VALID [2022-04-28 11:29:10,237 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 11:29:10,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5147#true} {5147#true} #84#return; {5147#true} is VALID [2022-04-28 11:29:10,238 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 11:29:10,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,238 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5147#true} {5147#true} #86#return; {5147#true} is VALID [2022-04-28 11:29:10,238 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 11:29:10,239 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 11:29:10,239 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 11:29:10,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,239 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 11:29:10,239 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 11:29:10,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,240 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 11:29:10,240 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 11:29:10,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,241 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 11:29:10,241 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 11:29:10,242 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 11:29:10,242 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 11:29:10,242 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 11:29:10,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,243 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 11:29:10,243 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 11:29:10,243 INFO L290 TraceCheckUtils]: 60: Hoare triple {5147#true} ~cond := #in~cond; {5147#true} is VALID [2022-04-28 11:29:10,243 INFO L290 TraceCheckUtils]: 61: Hoare triple {5147#true} assume !(0 == ~cond); {5147#true} is VALID [2022-04-28 11:29:10,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {5147#true} assume true; {5147#true} is VALID [2022-04-28 11:29:10,244 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 11:29:10,244 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 11:29:10,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 11:29:10,244 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 11:29:10,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L290 TraceCheckUtils]: 68: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L290 TraceCheckUtils]: 69: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5148#false} {5148#false} #88#return; {5148#false} is VALID [2022-04-28 11:29:10,244 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 11:29:10,244 INFO L290 TraceCheckUtils]: 72: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L290 TraceCheckUtils]: 73: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 11:29:10,244 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5148#false} {5148#false} #90#return; {5148#false} is VALID [2022-04-28 11:29:10,245 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 11:29:10,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 79: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {5148#false} {5148#false} #92#return; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 81: Hoare triple {5148#false} assume !(~r~0 >= 2 * ~b~0); {5148#false} is VALID [2022-04-28 11:29:10,245 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 11:29:10,245 INFO L290 TraceCheckUtils]: 83: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 11:29:10,245 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 11:29:10,245 INFO L290 TraceCheckUtils]: 85: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 86: Hoare triple {5148#false} assume !(0 == ~cond); {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 87: Hoare triple {5148#false} assume true; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {5148#false} {5148#false} #84#return; {5148#false} is VALID [2022-04-28 11:29:10,245 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 11:29:10,245 INFO L290 TraceCheckUtils]: 90: Hoare triple {5148#false} ~cond := #in~cond; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 91: Hoare triple {5148#false} assume 0 == ~cond; {5148#false} is VALID [2022-04-28 11:29:10,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {5148#false} assume !false; {5148#false} is VALID [2022-04-28 11:29:10,246 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 11:29:10,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:29:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073417955] [2022-04-28 11:29:10,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457279375] [2022-04-28 11:29:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457279375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:10,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:29:10,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1504816937] [2022-04-28 11:29:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1504816937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:10,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:10,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:29:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569383093] [2022-04-28 11:29:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:10,247 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 11:29:10,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:10,247 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 11:29:10,309 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 11:29:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:29:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:29:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:29:10,310 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 11:29:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:10,608 INFO L93 Difference]: Finished difference Result 157 states and 189 transitions. [2022-04-28 11:29:10,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:29:10,608 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 11:29:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:10,609 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 11:29:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-28 11:29:10,610 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 11:29:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-04-28 11:29:10,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-04-28 11:29:10,669 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 11:29:10,670 INFO L225 Difference]: With dead ends: 157 [2022-04-28 11:29:10,670 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 11:29:10,671 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 11:29:10,671 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 11:29:10,671 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 11:29:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 11:29:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2022-04-28 11:29:10,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:10,824 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 11:29:10,824 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 11:29:10,824 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 11:29:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:10,826 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 11:29:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-04-28 11:29:10,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:10,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:10,827 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 11:29:10,827 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 11:29:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:10,830 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-28 11:29:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2022-04-28 11:29:10,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:10,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:10,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:10,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:10,830 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 11:29:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-04-28 11:29:10,833 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 93 [2022-04-28 11:29:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:10,833 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-04-28 11:29:10,833 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 11:29:10,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 123 transitions. [2022-04-28 11:29:10,957 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 11:29:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-04-28 11:29:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-28 11:29:10,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:29:10,958 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 11:29:10,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 11:29:11,164 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 11:29:11,164 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:29:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:29:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -39671046, now seen corresponding path program 3 times [2022-04-28 11:29:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:11,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1456542433] [2022-04-28 11:29:11,165 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:29:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -39671046, now seen corresponding path program 4 times [2022-04-28 11:29:11,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:29:11,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635278553] [2022-04-28 11:29:11,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:29:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:29:11,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:29:11,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838813288] [2022-04-28 11:29:11,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:29:11,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:29:11,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:29:11,178 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 11:29:11,184 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 11:29:11,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:29:11,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:29:11,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:29:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:29:11,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:29:12,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {6165#true} call ULTIMATE.init(); {6165#true} is VALID [2022-04-28 11:29:12,694 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 11:29:12,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6165#true} {6165#true} #98#return; {6165#true} is VALID [2022-04-28 11:29:12,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {6165#true} call #t~ret6 := main(); {6165#true} is VALID [2022-04-28 11:29:12,694 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 11:29:12,695 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 11:29:12,696 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 11:29:12,697 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 11:29:12,697 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 11:29:12,697 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 11:29:12,698 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 11:29:12,698 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 11:29:12,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,698 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 11:29:12,698 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 11:29:12,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,699 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 11:29:12,699 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 11:29:12,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {6239#(<= main_~r~0 2)} assume !false; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 11:29:12,700 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 11:29:12,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,700 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 11:29:12,700 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 11:29:12,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,701 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 11:29:12,701 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 11:29:12,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {6239#(<= main_~r~0 2)} assume !false; {6239#(<= main_~r~0 2)} is VALID [2022-04-28 11:29:12,701 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 11:29:12,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,702 INFO L290 TraceCheckUtils]: 39: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,703 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 11:29:12,703 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 11:29:12,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,704 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 11:29:12,704 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 11:29:12,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,705 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 11:29:12,705 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 11:29:12,705 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 11:29:12,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,706 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 11:29:12,706 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 11:29:12,707 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 11:29:12,707 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 11:29:12,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,707 INFO L290 TraceCheckUtils]: 62: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,707 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 11:29:12,708 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 11:29:12,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,708 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 11:29:12,708 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 11:29:12,708 INFO L290 TraceCheckUtils]: 70: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,708 INFO L290 TraceCheckUtils]: 72: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,709 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 11:29:12,709 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 11:29:12,709 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 11:29:12,709 INFO L290 TraceCheckUtils]: 76: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,709 INFO L290 TraceCheckUtils]: 77: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,709 INFO L290 TraceCheckUtils]: 78: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,710 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 11:29:12,711 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 11:29:12,711 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 11:29:12,711 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 11:29:12,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,712 INFO L290 TraceCheckUtils]: 84: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,712 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 11:29:12,712 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 11:29:12,712 INFO L290 TraceCheckUtils]: 88: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,712 INFO L290 TraceCheckUtils]: 89: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,712 INFO L290 TraceCheckUtils]: 90: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,713 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 11:29:12,713 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 11:29:12,713 INFO L290 TraceCheckUtils]: 93: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:12,713 INFO L290 TraceCheckUtils]: 94: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:12,713 INFO L290 TraceCheckUtils]: 95: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:12,713 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 11:29:12,714 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 11:29:12,714 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 11:29:12,714 INFO L290 TraceCheckUtils]: 99: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 11:29:12,714 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 11:29:12,714 INFO L290 TraceCheckUtils]: 101: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 11:29:12,714 INFO L290 TraceCheckUtils]: 102: Hoare triple {6166#false} assume !(0 == ~cond); {6166#false} is VALID [2022-04-28 11:29:12,714 INFO L290 TraceCheckUtils]: 103: Hoare triple {6166#false} assume true; {6166#false} is VALID [2022-04-28 11:29:12,714 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {6166#false} {6166#false} #84#return; {6166#false} is VALID [2022-04-28 11:29:12,714 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 11:29:12,714 INFO L290 TraceCheckUtils]: 106: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 11:29:12,715 INFO L290 TraceCheckUtils]: 107: Hoare triple {6166#false} assume 0 == ~cond; {6166#false} is VALID [2022-04-28 11:29:12,715 INFO L290 TraceCheckUtils]: 108: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 11:29:12,715 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 11:29:12,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:29:13,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 11:29:13,793 INFO L290 TraceCheckUtils]: 107: Hoare triple {6166#false} assume 0 == ~cond; {6166#false} is VALID [2022-04-28 11:29:13,793 INFO L290 TraceCheckUtils]: 106: Hoare triple {6166#false} ~cond := #in~cond; {6166#false} is VALID [2022-04-28 11:29:13,793 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 11:29:13,793 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {6165#true} {6166#false} #84#return; {6166#false} is VALID [2022-04-28 11:29:13,793 INFO L290 TraceCheckUtils]: 103: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,793 INFO L290 TraceCheckUtils]: 102: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,793 INFO L290 TraceCheckUtils]: 101: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,793 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 11:29:13,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {6166#false} assume !false; {6166#false} is VALID [2022-04-28 11:29:13,793 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 11:29:13,793 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 11:29:13,794 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 11:29:13,794 INFO L290 TraceCheckUtils]: 95: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,794 INFO L290 TraceCheckUtils]: 93: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,794 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 11:29:13,795 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 11:29:13,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,795 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 11:29:13,795 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 11:29:13,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,795 INFO L290 TraceCheckUtils]: 83: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,796 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 11:29:13,796 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 11:29:13,796 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 11:29:13,797 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 11:29:13,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,797 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 11:29:13,798 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 11:29:13,798 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 11:29:13,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,798 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 11:29:13,799 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 11:29:13,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,799 INFO L290 TraceCheckUtils]: 66: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,799 INFO L290 TraceCheckUtils]: 65: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,799 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 11:29:13,799 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 11:29:13,799 INFO L290 TraceCheckUtils]: 62: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,799 INFO L290 TraceCheckUtils]: 60: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,800 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 11:29:13,800 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 11:29:13,800 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 11:29:13,801 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 11:29:13,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,801 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 11:29:13,801 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 11:29:13,802 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 11:29:13,802 INFO L290 TraceCheckUtils]: 49: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,802 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 11:29:13,803 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 11:29:13,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,803 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 11:29:13,803 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 11:29:13,803 INFO L290 TraceCheckUtils]: 39: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,803 INFO L290 TraceCheckUtils]: 38: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,804 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 11:29:13,804 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 11:29:13,805 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 11:29:13,805 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 11:29:13,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,806 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 11:29:13,806 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 11:29:13,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,806 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 11:29:13,806 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 11:29:13,807 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 11:29:13,808 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 11:29:13,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,808 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 11:29:13,808 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 11:29:13,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {6165#true} assume !(0 == ~cond); {6165#true} is VALID [2022-04-28 11:29:13,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {6165#true} ~cond := #in~cond; {6165#true} is VALID [2022-04-28 11:29:13,808 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 11:29:13,809 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 11:29:13,809 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 11:29:13,810 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 11:29:13,810 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 11:29:13,810 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 11:29:13,810 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 11:29:13,810 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 11:29:13,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {6165#true} call #t~ret6 := main(); {6165#true} is VALID [2022-04-28 11:29:13,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6165#true} {6165#true} #98#return; {6165#true} is VALID [2022-04-28 11:29:13,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {6165#true} assume true; {6165#true} is VALID [2022-04-28 11:29:13,811 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 11:29:13,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {6165#true} call ULTIMATE.init(); {6165#true} is VALID [2022-04-28 11:29:13,811 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 11:29:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:29:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635278553] [2022-04-28 11:29:13,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:29:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838813288] [2022-04-28 11:29:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838813288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:29:13,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:29:13,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2022-04-28 11:29:13,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:29:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1456542433] [2022-04-28 11:29:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1456542433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:29:13,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:29:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:29:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584476663] [2022-04-28 11:29:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:29:13,813 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 11:29:13,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:29:13,814 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 11:29:13,863 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 11:29:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:29:13,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:29:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:29:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:29:13,864 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 11:29:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:15,049 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-28 11:29:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:29:15,050 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 11:29:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:29:15,050 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 11:29:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-04-28 11:29:15,051 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 11:29:15,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2022-04-28 11:29:15,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 86 transitions. [2022-04-28 11:29:15,123 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 11:29:15,123 INFO L225 Difference]: With dead ends: 113 [2022-04-28 11:29:15,123 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:29:15,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:29:15,125 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 11:29:15,125 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 11:29:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:29:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:29:15,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:29:15,125 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 11:29:15,125 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 11:29:15,125 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 11:29:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:15,125 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:29:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:15,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:15,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:15,126 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 11:29:15,126 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 11:29:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:29:15,126 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:29:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:15,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:15,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:29:15,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:29:15,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:29:15,126 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 11:29:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:29:15,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-04-28 11:29:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:29:15,126 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:29:15,126 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 11:29:15,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:29:15,126 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 11:29:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:29:15,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:29:15,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:29:15,144 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 11:29:15,343 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 11:29:15,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:29:17,555 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:29:17,555 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:29:17,555 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:29:17,555 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:29:17,555 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 11:29:17,555 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 11:29:17,555 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 11:29:17,555 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2022-04-28 11:29:17,555 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 11:29:17,555 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 11:29:17,555 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 11:29:17,555 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 11:29:17,555 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 11:29:17,555 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 66) the Hoare annotation is: true [2022-04-28 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,556 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 66) the Hoare annotation is: true [2022-04-28 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,556 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 66) the Hoare annotation is: true [2022-04-28 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,556 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 11:29:17,557 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 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 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 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:29:17,557 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 11:29:17,557 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 11:29:17,557 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:29:17,557 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 11:29:17,557 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 11:29:17,557 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 11:29:17,559 INFO L356 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2] [2022-04-28 11:29:17,560 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:29:17,562 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:29:17,572 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 11:29:17,611 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 11:29:17,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 11:29:17 BoogieIcfgContainer [2022-04-28 11:29:17,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 11:29:17,621 INFO L158 Benchmark]: Toolchain (without parser) took 92138.55ms. Allocated memory was 188.7MB in the beginning and 235.9MB in the end (delta: 47.2MB). Free memory was 141.3MB in the beginning and 203.9MB in the end (delta: -62.6MB). Peak memory consumption was 111.0MB. Max. memory is 8.0GB. [2022-04-28 11:29:17,621 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 11:29:17,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.07ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 165.7MB in the end (delta: -24.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 11:29:17,621 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 188.7MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 11:29:17,621 INFO L158 Benchmark]: RCFGBuilder took 244.49ms. Allocated memory is still 188.7MB. Free memory was 164.1MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 11:29:17,622 INFO L158 Benchmark]: TraceAbstraction took 91674.92ms. Allocated memory was 188.7MB in the beginning and 235.9MB in the end (delta: 47.2MB). Free memory was 151.0MB in the beginning and 203.9MB in the end (delta: -52.9MB). Peak memory consumption was 120.7MB. Max. memory is 8.0GB. [2022-04-28 11:29:17,622 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 188.7MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.07ms. Allocated memory is still 188.7MB. Free memory was 141.1MB in the beginning and 165.7MB in the end (delta: -24.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 188.7MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.49ms. Allocated memory is still 188.7MB. Free memory was 164.1MB in the beginning and 151.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 91674.92ms. Allocated memory was 188.7MB in the beginning and 235.9MB in the end (delta: 47.2MB). Free memory was 151.0MB in the beginning and 203.9MB in the end (delta: -52.9MB). Peak memory consumption was 120.7MB. 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: 91.6s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 1471 SdHoareTripleChecker+Invalid, 1.8s 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, 255 ImplicationChecksByTransitivity, 1.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.7s 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 11:29:17,654 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...