/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:09:52,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:09:52,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:09:52,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:09:52,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:09:52,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:09:52,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:09:52,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:09:52,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:09:52,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:09:52,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:09:52,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:09:52,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:09:52,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:09:52,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:09:52,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:09:52,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:09:52,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:09:52,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:09:52,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:09:52,801 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:09:52,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:09:52,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:09:52,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:09:52,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:09:52,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:09:52,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:09:52,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:09:52,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:09:52,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:09:52,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:09:52,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:09:52,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:09:52,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:09:52,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:09:52,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:09:52,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:09:52,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:09:52,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:09:52,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:09:52,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:09:52,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:09:52,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:09:52,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:09:52,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:09:52,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:09:52,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:09:52,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:09:52,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:09:52,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:09:52,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:09:52,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:09:52,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:09:52,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:09:52,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:09:52,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:09:52,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:09:52,844 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 06:09:53,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:09:53,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:09:53,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:09:53,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:09:53,107 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:09:53,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound10.c [2022-04-28 06:09:53,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0aadf68/86e88b2bd19b45a18fce79a9616c1079/FLAG50eb972a0 [2022-04-28 06:09:53,575 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:09:53,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound10.c [2022-04-28 06:09:53,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0aadf68/86e88b2bd19b45a18fce79a9616c1079/FLAG50eb972a0 [2022-04-28 06:09:53,600 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0aadf68/86e88b2bd19b45a18fce79a9616c1079 [2022-04-28 06:09:53,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:09:53,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:09:53,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:09:53,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:09:53,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:09:53,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e780c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53, skipping insertion in model container [2022-04-28 06:09:53,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:09:53,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:09:53,777 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/geo3-ll_valuebound10.c[525,538] [2022-04-28 06:09:53,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:09:53,808 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:09:53,818 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/geo3-ll_valuebound10.c[525,538] [2022-04-28 06:09:53,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:09:53,835 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:09:53,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53 WrapperNode [2022-04-28 06:09:53,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:09:53,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:09:53,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:09:53,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:09:53,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:09:53,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:09:53,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:09:53,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:09:53,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (1/1) ... [2022-04-28 06:09:53,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:09:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:53,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 06:09:53,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 06:09:53,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:09:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:09:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:09:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:09:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:09:53,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:09:53,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:09:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:09:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:09:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:09:53,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:09:53,984 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:09:53,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:09:54,185 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:09:54,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:09:54,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 06:09:54,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:09:54 BoogieIcfgContainer [2022-04-28 06:09:54,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:09:54,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:09:54,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:09:54,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:09:54,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:09:53" (1/3) ... [2022-04-28 06:09:54,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502d756a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:09:54, skipping insertion in model container [2022-04-28 06:09:54,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:09:53" (2/3) ... [2022-04-28 06:09:54,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502d756a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:09:54, skipping insertion in model container [2022-04-28 06:09:54,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:09:54" (3/3) ... [2022-04-28 06:09:54,212 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound10.c [2022-04-28 06:09:54,224 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:09:54,225 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:09:54,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:09:54,285 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@3808688, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@17900e5e [2022-04-28 06:09:54,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:09:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:09:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 06:09:54,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:54,306 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, 1] [2022-04-28 06:09:54,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:54,312 INFO L85 PathProgramCache]: Analyzing trace with hash -779299010, now seen corresponding path program 1 times [2022-04-28 06:09:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:54,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218143567] [2022-04-28 06:09:54,330 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash -779299010, now seen corresponding path program 2 times [2022-04-28 06:09:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:54,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125421225] [2022-04-28 06:09:54,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:09:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:54,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 06:09:54,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:09:54,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-28 06:09:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 06:09:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:54,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 06:09:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 06:09:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:54,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-28 06:09:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 06:09:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:54,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-28 06:09:54,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:09:54,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 06:09:54,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 06:09:54,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #65#return; {34#true} is VALID [2022-04-28 06:09:54,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-28 06:09:54,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-28 06:09:54,607 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-28 06:09:54,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 06:09:54,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {35#false} is VALID [2022-04-28 06:09:54,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-28 06:09:54,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,611 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} #57#return; {35#false} is VALID [2022-04-28 06:09:54,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {35#false} is VALID [2022-04-28 06:09:54,611 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {34#true} is VALID [2022-04-28 06:09:54,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 06:09:54,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 06:09:54,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 06:09:54,614 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} #59#return; {35#false} is VALID [2022-04-28 06:09:54,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {35#false} is VALID [2022-04-28 06:09:54,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-28 06:09:54,614 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-28 06:09:54,614 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 06:09:54,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 06:09:54,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 06:09:54,616 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 06:09:54,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:54,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125421225] [2022-04-28 06:09:54,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125421225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:54,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:54,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:09:54,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:54,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218143567] [2022-04-28 06:09:54,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218143567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:54,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:54,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:09:54,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951233915] [2022-04-28 06:09:54,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 29 [2022-04-28 06:09:54,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:54,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 06:09:54,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:54,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:09:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:09:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:09:54,698 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 06:09:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:54,856 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-28 06:09:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:09:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 29 [2022-04-28 06:09:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 06:09:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 06:09:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 06:09:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-28 06:09:54,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-28 06:09:54,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:54,994 INFO L225 Difference]: With dead ends: 55 [2022-04-28 06:09:54,994 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 06:09:54,997 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 06:09:55,000 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:55,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 06:09:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 06:09:55,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:55,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:09:55,033 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:09:55,034 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:09:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:55,038 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 06:09:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 06:09:55,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:55,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:55,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-28 06:09:55,040 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-28 06:09:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:55,044 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 06:09:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 06:09:55,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:55,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:55,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:55,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:09:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-28 06:09:55,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2022-04-28 06:09:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:55,050 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-28 06:09:55,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 06:09:55,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-28 06:09:55,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-28 06:09:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 06:09:55,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:55,088 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, 1] [2022-04-28 06:09:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:09:55,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash -963850242, now seen corresponding path program 1 times [2022-04-28 06:09:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033606333] [2022-04-28 06:09:55,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -963850242, now seen corresponding path program 2 times [2022-04-28 06:09:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:55,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516943449] [2022-04-28 06:09:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:55,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:55,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424527305] [2022-04-28 06:09:55,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:55,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:55,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:55,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:55,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 06:09:55,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:09:55,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:55,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:09:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:55,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:55,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2022-04-28 06:09:55,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {268#true} is VALID [2022-04-28 06:09:55,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-28 06:09:55,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {268#true} {268#true} #65#return; {268#true} is VALID [2022-04-28 06:09:55,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {268#true} call #t~ret7 := main(); {268#true} is VALID [2022-04-28 06:09:55,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {268#true} is VALID [2022-04-28 06:09:55,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {268#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {268#true} is VALID [2022-04-28 06:09:55,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-28 06:09:55,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-28 06:09:55,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-28 06:09:55,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#true} {268#true} #55#return; {268#true} is VALID [2022-04-28 06:09:55,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {268#true} is VALID [2022-04-28 06:09:55,440 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {268#true} is VALID [2022-04-28 06:09:55,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-28 06:09:55,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-28 06:09:55,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-28 06:09:55,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {268#true} {268#true} #57#return; {268#true} is VALID [2022-04-28 06:09:55,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {268#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {268#true} is VALID [2022-04-28 06:09:55,442 INFO L272 TraceCheckUtils]: 18: Hoare triple {268#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {268#true} is VALID [2022-04-28 06:09:55,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {268#true} ~cond := #in~cond; {268#true} is VALID [2022-04-28 06:09:55,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {268#true} assume !(0 == ~cond); {268#true} is VALID [2022-04-28 06:09:55,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {268#true} assume true; {268#true} is VALID [2022-04-28 06:09:55,442 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {268#true} {268#true} #59#return; {268#true} is VALID [2022-04-28 06:09:55,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {268#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:55,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:55,445 INFO L272 TraceCheckUtils]: 25: Hoare triple {342#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:55,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {349#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:55,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {353#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {269#false} is VALID [2022-04-28 06:09:55,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {269#false} assume !false; {269#false} is VALID [2022-04-28 06:09:55,447 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 06:09:55,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:09:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:55,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516943449] [2022-04-28 06:09:55,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:55,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424527305] [2022-04-28 06:09:55,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424527305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:55,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:55,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:09:55,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033606333] [2022-04-28 06:09:55,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033606333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:55,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:55,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:09:55,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163994711] [2022-04-28 06:09:55,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:55,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 29 [2022-04-28 06:09:55,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:55,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 06:09:55,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:55,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:09:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:09:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:09:55,478 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 06:09:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:55,634 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 06:09:55,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:09:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 29 [2022-04-28 06:09:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 06:09:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 06:09:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 06:09:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 06:09:55,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 06:09:55,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:55,686 INFO L225 Difference]: With dead ends: 36 [2022-04-28 06:09:55,688 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 06:09:55,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:09:55,691 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:55,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:09:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 06:09:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 06:09:55,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:55,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:09:55,708 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:09:55,709 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:09:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:55,712 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 06:09:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 06:09:55,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:55,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:55,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 06:09:55,717 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-28 06:09:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:55,720 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 06:09:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 06:09:55,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:55,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:55,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:55,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:09:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-28 06:09:55,728 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-28 06:09:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:55,728 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-28 06:09:55,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (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 06:09:55,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-28 06:09:55,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 06:09:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 06:09:55,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:09:55,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:09:55,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:09:55,999 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 06:09:56,000 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:09:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:09:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash -425626518, now seen corresponding path program 1 times [2022-04-28 06:09:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:56,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949170165] [2022-04-28 06:09:56,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:09:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash -425626518, now seen corresponding path program 2 times [2022-04-28 06:09:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:09:56,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73906334] [2022-04-28 06:09:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:09:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:09:56,019 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:09:56,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2015818679] [2022-04-28 06:09:56,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:09:56,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:09:56,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:09:56,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 06:09:56,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:09:56,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:09:56,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 06:09:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:09:56,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:09:56,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-28 06:09:56,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-28 06:09:56,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:09:56,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #65#return; {565#true} is VALID [2022-04-28 06:09:56,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2022-04-28 06:09:56,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {565#true} is VALID [2022-04-28 06:09:56,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:09:56,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 06:09:56,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 06:09:56,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:09:56,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #55#return; {565#true} is VALID [2022-04-28 06:09:56,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-28 06:09:56,378 INFO L272 TraceCheckUtils]: 12: Hoare triple {565#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:09:56,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 06:09:56,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 06:09:56,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:09:56,379 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {565#true} {565#true} #57#return; {565#true} is VALID [2022-04-28 06:09:56,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {565#true} is VALID [2022-04-28 06:09:56,379 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:09:56,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {627#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:09:56,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {627#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:09:56,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:09:56,381 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {631#(not (= |assume_abort_if_not_#in~cond| 0))} {565#true} #59#return; {565#true} is VALID [2022-04-28 06:09:56,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:56,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:56,383 INFO L272 TraceCheckUtils]: 25: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {565#true} is VALID [2022-04-28 06:09:56,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {565#true} ~cond := #in~cond; {651#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:56,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {651#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:56,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:56,386 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:56,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {641#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:56,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:09:56,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {665#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:56,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:56,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-28 06:09:56,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-28 06:09:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 06:09:56,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:10:05,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {566#false} assume !false; {566#false} is VALID [2022-04-28 06:10:05,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {676#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {566#false} is VALID [2022-04-28 06:10:05,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {672#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {676#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:10:05,144 INFO L272 TraceCheckUtils]: 32: Hoare triple {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {672#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:10:05,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:10:05,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {699#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {692#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:10:05,215 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} {565#true} #61#return; {699#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:10:05,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:05,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:05,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {565#true} ~cond := #in~cond; {712#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:10:05,224 INFO L272 TraceCheckUtils]: 25: Hoare triple {565#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {565#true} is VALID [2022-04-28 06:10:05,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {565#true} assume !false; {565#true} is VALID [2022-04-28 06:10:05,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {565#true} is VALID [2022-04-28 06:10:05,225 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {565#true} {565#true} #59#return; {565#true} is VALID [2022-04-28 06:10:05,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:10:05,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 06:10:05,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 06:10:05,225 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:10:05,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {565#true} is VALID [2022-04-28 06:10:05,226 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {565#true} {565#true} #57#return; {565#true} is VALID [2022-04-28 06:10:05,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:10:05,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 06:10:05,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 06:10:05,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {565#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:10:05,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {565#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {565#true} is VALID [2022-04-28 06:10:05,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {565#true} {565#true} #55#return; {565#true} is VALID [2022-04-28 06:10:05,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:10:05,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {565#true} assume !(0 == ~cond); {565#true} is VALID [2022-04-28 06:10:05,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {565#true} ~cond := #in~cond; {565#true} is VALID [2022-04-28 06:10:05,227 INFO L272 TraceCheckUtils]: 6: Hoare triple {565#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {565#true} is VALID [2022-04-28 06:10:05,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {565#true} is VALID [2022-04-28 06:10:05,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret7 := main(); {565#true} is VALID [2022-04-28 06:10:05,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #65#return; {565#true} is VALID [2022-04-28 06:10:05,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2022-04-28 06:10:05,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {565#true} is VALID [2022-04-28 06:10:05,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2022-04-28 06:10:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 06:10:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:10:05,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73906334] [2022-04-28 06:10:05,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:10:05,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015818679] [2022-04-28 06:10:05,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015818679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:10:05,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:10:05,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 06:10:05,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:10:05,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949170165] [2022-04-28 06:10:05,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949170165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:10:05,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:10:05,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:10:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461139271] [2022-04-28 06:10:05,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:10:05,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 06:10:05,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:10:05,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:10:05,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:10:05,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:10:05,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:10:05,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:10:05,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:10:05,296 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:10:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:06,570 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 06:10:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 06:10:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-28 06:10:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:10:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:10:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 06:10:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:10:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2022-04-28 06:10:06,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2022-04-28 06:10:06,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:10:06,659 INFO L225 Difference]: With dead ends: 43 [2022-04-28 06:10:06,660 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 06:10:06,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:10:06,661 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 06:10:06,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 06:10:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 06:10:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 06:10:06,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:10:06,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:10:06,677 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:10:06,677 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:10:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:06,679 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 06:10:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 06:10:06,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:10:06,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:10:06,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 06:10:06,680 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-28 06:10:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:06,682 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 06:10:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 06:10:06,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:10:06,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:10:06,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:10:06,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:10:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:10:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 06:10:06,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-04-28 06:10:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:10:06,685 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 06:10:06,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 06:10:06,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 06:10:06,762 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 06:10:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 06:10:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 06:10:06,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:10:06,763 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:10:06,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 06:10:06,963 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 06:10:06,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:10:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:10:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1540046462, now seen corresponding path program 3 times [2022-04-28 06:10:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:10:06,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344779722] [2022-04-28 06:10:06,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:10:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1540046462, now seen corresponding path program 4 times [2022-04-28 06:10:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:10:06,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955304079] [2022-04-28 06:10:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:10:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:10:06,981 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:10:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21670457] [2022-04-28 06:10:06,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:10:06,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:10:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:10:06,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:10:06,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:10:07,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:10:07,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:10:07,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 06:10:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:10:07,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:10:08,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2022-04-28 06:10:08,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1045#true} is VALID [2022-04-28 06:10:08,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:08,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #65#return; {1045#true} is VALID [2022-04-28 06:10:08,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret7 := main(); {1045#true} is VALID [2022-04-28 06:10:08,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1045#true} is VALID [2022-04-28 06:10:08,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {1045#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:08,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#true} ~cond := #in~cond; {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:10:08,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:10:08,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:10:08,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} {1045#true} #55#return; {1082#(and (<= main_~z~0 10) (<= 0 main_~z~0))} is VALID [2022-04-28 06:10:08,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(and (<= main_~z~0 10) (<= 0 main_~z~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1082#(and (<= main_~z~0 10) (<= 0 main_~z~0))} is VALID [2022-04-28 06:10:08,070 INFO L272 TraceCheckUtils]: 12: Hoare triple {1082#(and (<= main_~z~0 10) (<= 0 main_~z~0))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:08,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} ~cond := #in~cond; {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 06:10:08,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:10:08,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1075#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 06:10:08,072 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1075#(not (= |assume_abort_if_not_#in~cond| 0))} {1082#(and (<= main_~z~0 10) (<= 0 main_~z~0))} #57#return; {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-28 06:10:08,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-28 06:10:08,073 INFO L272 TraceCheckUtils]: 18: Hoare triple {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:08,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:08,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:08,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:08,074 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1045#true} {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} #59#return; {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} is VALID [2022-04-28 06:10:08,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {1101#(and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10))} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,075 INFO L272 TraceCheckUtils]: 25: Hoare triple {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:08,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#true} ~cond := #in~cond; {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:10:08,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:08,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:08,077 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {1123#(and (<= main_~z~0 10) (= main_~y~0 1) (<= 0 main_~a~0) (<= 0 main_~z~0) (= main_~a~0 main_~x~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,079 INFO L272 TraceCheckUtils]: 32: Hoare triple {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:08,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:08,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:08,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:08,080 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1045#true} {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {1147#(and (<= main_~z~0 10) (= main_~z~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1169#(and (<= main_~z~0 10) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {1169#(and (<= main_~z~0 10) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1169#(and (<= main_~z~0 10) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:10:08,087 INFO L272 TraceCheckUtils]: 39: Hoare triple {1169#(and (<= main_~z~0 10) (= main_~x~0 (+ (* main_~z~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) main_~a~0)) (<= 0 main_~a~0) (= (* main_~z~0 main_~z~0) main_~y~0) (<= 0 main_~z~0) (<= main_~a~0 10) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:10:08,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:10:08,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1046#false} is VALID [2022-04-28 06:10:08,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-04-28 06:10:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 06:10:08,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:10:17,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {1046#false} assume !false; {1046#false} is VALID [2022-04-28 06:10:17,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {1180#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1046#false} is VALID [2022-04-28 06:10:17,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1180#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:10:17,964 INFO L272 TraceCheckUtils]: 39: Hoare triple {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1176#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:10:17,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:10:17,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1196#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:10:17,995 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1045#true} {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} #61#return; {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:10:17,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:17,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:17,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:17,995 INFO L272 TraceCheckUtils]: 32: Hoare triple {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:17,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !false; {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:10:18,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:10:18,073 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} {1045#true} #61#return; {1203#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:10:18,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:18,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {1237#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:10:18,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {1045#true} ~cond := #in~cond; {1237#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:10:18,074 INFO L272 TraceCheckUtils]: 25: Hoare triple {1045#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {1045#true} assume !false; {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {1045#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1045#true} {1045#true} #59#return; {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:18,075 INFO L272 TraceCheckUtils]: 18: Hoare triple {1045#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {1045#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1045#true} {1045#true} #57#return; {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L272 TraceCheckUtils]: 12: Hoare triple {1045#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:18,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {1045#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1045#true} {1045#true} #55#return; {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#true} assume !(0 == ~cond); {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#true} ~cond := #in~cond; {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {1045#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {1045#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {1045#true} call #t~ret7 := main(); {1045#true} is VALID [2022-04-28 06:10:18,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1045#true} {1045#true} #65#return; {1045#true} is VALID [2022-04-28 06:10:18,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1045#true} assume true; {1045#true} is VALID [2022-04-28 06:10:18,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1045#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1045#true} is VALID [2022-04-28 06:10:18,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {1045#true} call ULTIMATE.init(); {1045#true} is VALID [2022-04-28 06:10:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 06:10:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:10:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955304079] [2022-04-28 06:10:18,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:10:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21670457] [2022-04-28 06:10:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21670457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:10:18,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:10:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 06:10:18,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:10:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344779722] [2022-04-28 06:10:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344779722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:10:18,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:10:18,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:10:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357271052] [2022-04-28 06:10:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:10:18,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-04-28 06:10:18,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:10:18,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:10:18,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:10:18,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:10:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:10:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:10:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:10:18,124 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:10:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:18,813 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 06:10:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 06:10:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-04-28 06:10:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:10:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:10:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-28 06:10:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:10:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-28 06:10:18,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2022-04-28 06:10:18,870 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 06:10:18,871 INFO L225 Difference]: With dead ends: 50 [2022-04-28 06:10:18,871 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 06:10:18,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-28 06:10:18,873 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:10:18,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 159 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 06:10:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 06:10:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 06:10:18,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:10:18,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:10:18,925 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:10:18,925 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:10:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:18,928 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 06:10:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 06:10:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:10:18,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:10:18,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 06:10:18,929 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-04-28 06:10:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:10:18,931 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 06:10:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 06:10:18,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:10:18,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:10:18,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:10:18,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:10:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:10:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 06:10:18,933 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 43 [2022-04-28 06:10:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:10:18,934 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 06:10:18,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:10:18,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 06:10:19,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:10:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 06:10:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 06:10:19,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:10:19,004 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:10:19,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:10:19,215 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 06:10:19,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:10:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:10:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1099019754, now seen corresponding path program 5 times [2022-04-28 06:10:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:10:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344063338] [2022-04-28 06:10:19,216 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:10:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1099019754, now seen corresponding path program 6 times [2022-04-28 06:10:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:10:19,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918568397] [2022-04-28 06:10:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:10:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:10:19,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:10:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845959902] [2022-04-28 06:10:19,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:10:19,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:10:19,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:10:19,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:10:19,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:10:19,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 06:10:19,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:10:19,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 06:10:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:10:19,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:10:33,356 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:10:39,372 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:10:49,281 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:11:26,765 WARN L232 SmtUtils]: Spent 20.68s on a formula simplification. DAG size of input: 46 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 06:11:41,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {1612#true} call ULTIMATE.init(); {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1612#true} #65#return; {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {1612#true} call #t~ret7 := main(); {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1612#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {1612#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:11:41,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1612#true} {1612#true} #55#return; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L272 TraceCheckUtils]: 12: Hoare triple {1612#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1612#true} {1612#true} #57#return; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {1612#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:11:41,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:11:41,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,312 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1612#true} {1612#true} #59#return; {1612#true} is VALID [2022-04-28 06:11:41,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:11:41,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:11:41,313 INFO L272 TraceCheckUtils]: 25: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:11:41,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:11:41,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,314 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1612#true} {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #61#return; {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:11:41,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {1686#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-28 06:11:41,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !false; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-28 06:11:41,315 INFO L272 TraceCheckUtils]: 32: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:11:41,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:11:41,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:11:41,316 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1612#true} {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} #61#return; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-28 06:11:41,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-28 06:11:41,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} assume !false; {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} is VALID [2022-04-28 06:11:41,316 INFO L272 TraceCheckUtils]: 39: Hoare triple {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:11:41,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {1612#true} ~cond := #in~cond; {1739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:11:41,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {1739#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:11:41,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:11:41,319 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} {1708#(= (* main_~a~0 main_~z~0) main_~az~0)} #61#return; {1750#(and (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:11:43,322 WARN L290 TraceCheckUtils]: 44: Hoare triple {1750#(and (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} is UNKNOWN [2022-04-28 06:11:43,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 06:11:43,359 INFO L272 TraceCheckUtils]: 46: Hoare triple {1754#(and (or (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))) (= main_~az~0 0)) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:11:43,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:11:43,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1613#false} is VALID [2022-04-28 06:11:43,360 INFO L290 TraceCheckUtils]: 49: Hoare triple {1613#false} assume !false; {1613#false} is VALID [2022-04-28 06:11:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 06:11:43,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:12:16,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {1613#false} assume !false; {1613#false} is VALID [2022-04-28 06:12:16,098 INFO L290 TraceCheckUtils]: 48: Hoare triple {1765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1613#false} is VALID [2022-04-28 06:12:16,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:12:16,100 INFO L272 TraceCheckUtils]: 46: Hoare triple {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:12:16,100 INFO L290 TraceCheckUtils]: 45: Hoare triple {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:12:16,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {1788#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1781#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 06:12:16,208 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} {1612#true} #61#return; {1788#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 06:12:16,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:16,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {1801#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:12:16,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {1612#true} ~cond := #in~cond; {1801#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:12:16,209 INFO L272 TraceCheckUtils]: 39: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {1612#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1612#true} {1612#true} #61#return; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L272 TraceCheckUtils]: 32: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {1612#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1612#true} {1612#true} #61#return; {1612#true} is VALID [2022-04-28 06:12:16,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L272 TraceCheckUtils]: 25: Hoare triple {1612#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1612#true} assume !false; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1612#true} ~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1612#true} {1612#true} #59#return; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L272 TraceCheckUtils]: 18: Hoare triple {1612#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {1612#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1612#true} {1612#true} #57#return; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L272 TraceCheckUtils]: 12: Hoare triple {1612#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1612#true} {1612#true} #55#return; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1612#true} assume !(0 == ~cond); {1612#true} is VALID [2022-04-28 06:12:16,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1612#true} ~cond := #in~cond; {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {1612#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 10 then 1 else 0)); {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1612#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4; {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1612#true} call #t~ret7 := main(); {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1612#true} {1612#true} #65#return; {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1612#true} assume true; {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {1612#true} call ULTIMATE.init(); {1612#true} is VALID [2022-04-28 06:12:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 06:12:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:12:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918568397] [2022-04-28 06:12:16,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:12:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845959902] [2022-04-28 06:12:16,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845959902] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:12:16,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:12:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 06:12:16,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:12:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344063338] [2022-04-28 06:12:16,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344063338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:12:16,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:12:16,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:12:16,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916107863] [2022-04-28 06:12:16,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:12:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-28 06:12:16,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:12:16,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:12:18,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:12:18,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:12:18,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:12:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:12:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:12:18,302 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:12:25,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:12:30,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:12:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:12:33,613 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-28 06:12:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:12:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2022-04-28 06:12:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:12:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:12:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 06:12:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:12:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-28 06:12:33,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-28 06:12:37,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 31 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:12:37,693 INFO L225 Difference]: With dead ends: 47 [2022-04-28 06:12:37,694 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 06:12:37,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 06:12:37,695 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 06:12:37,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 06:12:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 06:12:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 06:12:37,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:12:37,696 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 06:12:37,696 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 06:12:37,696 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 06:12:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:12:37,696 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:12:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:12:37,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:12:37,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:12:37,696 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 06:12:37,697 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 06:12:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:12:37,697 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:12:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:12:37,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:12:37,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:12:37,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:12:37,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:12:37,697 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 06:12:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 06:12:37,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-04-28 06:12:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:12:37,697 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 06:12:37,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-28 06:12:37,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 06:12:37,698 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 06:12:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:12:37,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:12:37,700 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 06:12:37,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 06:12:37,907 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 06:12:37,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 06:13:18,833 WARN L232 SmtUtils]: Spent 40.85s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:13:46,676 WARN L232 SmtUtils]: Spent 27.83s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:14:55,689 WARN L232 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:15:32,596 WARN L232 SmtUtils]: Spent 36.87s on a formula simplification. DAG size of input: 58 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:15:32,650 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 06:15:32,650 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 06:15:32,650 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 06:15:32,650 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 06:15:32,650 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 06:15:32,650 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 06:15:32,650 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 06:15:32,650 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10)) [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10)) [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~z~0 10) (<= 0 main_~z~0)) [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~z~0 10) (<= 0 main_~a~0) (<= 0 main_~z~0) (<= main_~a~0 10)) [2022-04-28 06:15:32,651 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-28 06:15:32,651 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 48) the Hoare annotation is: true [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= main_~z~0 10) (<= 0 main_~z~0)) [2022-04-28 06:15:32,651 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-28 06:15:32,651 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 48) the Hoare annotation is: true [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 45) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 10)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (<= main_~a~0 10)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse7 .cse10 .cse11))) [2022-04-28 06:15:32,651 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 45) the Hoare annotation is: (let ((.cse3 (* main_~a~0 main_~z~0))) (let ((.cse1 (<= main_~z~0 10)) (.cse2 (<= 0 main_~a~0)) (.cse4 (<= 0 main_~z~0)) (.cse5 (<= main_~a~0 10)) (.cse0 (= .cse3 main_~az~0))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (and .cse1 .cse2 (= main_~x~0 (+ .cse3 main_~a~0 (* main_~a~0 main_~z~0 main_~z~0))) (= (* main_~z~0 main_~z~0) main_~y~0) .cse4 .cse5 .cse0) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse3 main_~a~0)) .cse0) (let ((.cse6 (+ (* (- 1) main_~a~0) main_~x~0))) (and .cse1 (= 0 (mod .cse6 main_~z~0)) .cse2 (let ((.cse7 (div .cse6 main_~z~0))) (let ((.cse9 (= main_~az~0 0)) (.cse8 (* .cse7 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse7 (+ main_~a~0 .cse8)) .cse9) (let ((.cse10 (+ (* (- 1) .cse7) main_~a~0 .cse8))) (and (= (mod .cse10 main_~az~0) 0) (not .cse9) (= (* (div .cse10 main_~az~0) main_~z~0) main_~y~0)))))) (not (= main_~z~0 0)) .cse4 .cse5 .cse0))))) [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 21 48) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 10)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (<= main_~a~0 10)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse7 .cse10 .cse11))) [2022-04-28 06:15:32,652 INFO L895 garLoopResultBuilder]: At program point L37-1(lines 36 45) the Hoare annotation is: (let ((.cse0 (<= main_~z~0 10)) (.cse8 (<= 0 main_~a~0)) (.cse9 (<= 0 main_~z~0)) (.cse7 (= main_~a~0 main_~x~0)) (.cse10 (<= main_~a~0 10)) (.cse11 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (and .cse0 (let ((.cse6 (= main_~z~0 0))) (or (let ((.cse1 (+ (* (- 1) main_~a~0) main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse2 (div .cse1 main_~z~0))) (let ((.cse4 (= main_~az~0 0)) (.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3)) .cse4) (let ((.cse5 (+ (* (- 1) .cse2) main_~a~0 .cse3))) (and (= (mod .cse5 main_~az~0) 0) (not .cse4) (= (* (div .cse5 main_~az~0) main_~z~0) main_~y~0)))))) (not .cse6))) (and .cse6 (= main_~y~0 0) .cse7))) .cse8 .cse9 .cse10 .cse11) (and .cse0 (= main_~y~0 1) .cse8 .cse9 .cse7 .cse10 .cse11))) [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 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 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 06:15:32,652 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 06:15:32,652 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 06:15:32,652 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 06:15:32,653 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 06:15:32,653 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 06:15:32,653 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 06:15:32,655 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2] [2022-04-28 06:15:32,657 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 06:15:32,659 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 06:15:32,665 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 06:15:34,686 INFO L163 areAnnotationChecker]: CFG has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 06:15:34,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 06:15:34 BoogieIcfgContainer [2022-04-28 06:15:34,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 06:15:34,697 INFO L158 Benchmark]: Toolchain (without parser) took 341093.24ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 133.8MB in the beginning and 114.0MB in the end (delta: 19.8MB). Peak memory consumption was 64.5MB. Max. memory is 8.0GB. [2022-04-28 06:15:34,697 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 06:15:34,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.29ms. Allocated memory is still 183.5MB. Free memory was 133.7MB in the beginning and 159.2MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 06:15:34,698 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 183.5MB. Free memory was 159.2MB in the beginning and 157.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 06:15:34,698 INFO L158 Benchmark]: RCFGBuilder took 331.34ms. Allocated memory is still 183.5MB. Free memory was 157.7MB in the beginning and 146.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 06:15:34,699 INFO L158 Benchmark]: TraceAbstraction took 340502.34ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 145.6MB in the beginning and 114.0MB in the end (delta: 31.6MB). Peak memory consumption was 76.7MB. Max. memory is 8.0GB. [2022-04-28 06:15:34,700 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 183.5MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.29ms. Allocated memory is still 183.5MB. Free memory was 133.7MB in the beginning and 159.2MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 183.5MB. Free memory was 159.2MB in the beginning and 157.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.34ms. Allocated memory is still 183.5MB. Free memory was 157.7MB in the beginning and 146.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 340502.34ms. Allocated memory was 183.5MB in the beginning and 227.5MB in the end (delta: 44.0MB). Free memory was 145.6MB in the beginning and 114.0MB in the end (delta: 31.6MB). Peak memory consumption was 76.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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 338.4s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 174.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 573 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 125 mSDtfsCounter, 397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 101 PreInvPairs, 161 NumberOfFragments, 758 HoareAnnotationTreeSize, 101 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 31 FomulaSimplificationsInter, 956 FormulaSimplificationTreeSizeReductionInter, 174.6s 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: 36]: Loop Invariant Derived loop invariant: (((((z <= 10 && (((0 == (-1 * a + x) % z && (((y % z == 0 && (-1 * a + x) / z == a + (-1 * a + x) / z * z) && az == 0) || (((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0 && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y))) && !(z == 0)) || ((z == 0 && y == 0) && a == x))) && 0 <= a) && 0 <= z) && a <= 10) && a * z == az) || ((((((z <= 10 && y == 1) && 0 <= a) && 0 <= z) && a == x) && a <= 10) && a * z == az) - 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: 21]: 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 06:15:34,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...