/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/prodbin-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:55:21,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:55:21,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:55:21,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:55:21,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:55:21,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:55:21,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:55:21,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:55:21,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:55:21,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:55:21,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:55:21,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:55:21,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:55:21,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:55:21,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:55:21,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:55:21,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:55:21,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:55:21,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:55:21,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:55:21,624 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:55:21,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:55:21,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:55:21,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:55:21,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:55:21,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:55:21,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:55:21,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:55:21,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:55:21,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:55:21,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:55:21,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:55:21,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:55:21,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:55:21,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:55:21,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:55:21,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:55:21,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:55:21,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:55:21,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:55:21,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:55:21,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:55:21,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:55:21,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:55:21,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:55:21,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:55:21,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:55:21,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:55:21,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:55:21,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:55:21,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:55:21,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:55:21,665 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:55:21,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:55:21,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:55:21,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:55:21,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:55:21,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:55:21,666 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:55:21,667 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 10:55:21,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:55:21,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:55:21,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:55:21,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:55:21,959 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:55:21,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-28 10:55:22,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be948e70/27744c4cd1364839b927f207c756db03/FLAGeb10b72e6 [2022-04-28 10:55:22,456 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:55:22,457 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-28 10:55:22,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be948e70/27744c4cd1364839b927f207c756db03/FLAGeb10b72e6 [2022-04-28 10:55:22,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be948e70/27744c4cd1364839b927f207c756db03 [2022-04-28 10:55:22,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:55:22,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:55:22,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:55:22,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:55:22,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:55:22,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:55:22" (1/1) ... [2022-04-28 10:55:22,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@414fd419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:22, skipping insertion in model container [2022-04-28 10:55:22,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:55:22" (1/1) ... [2022-04-28 10:55:22,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:55:22,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:55:23,058 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/prodbin-ll.c[537,550] [2022-04-28 10:55:23,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:55:23,121 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:55:23,134 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/prodbin-ll.c[537,550] [2022-04-28 10:55:23,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:55:23,166 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:55:23,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23 WrapperNode [2022-04-28 10:55:23,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:55:23,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:55:23,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:55:23,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:55:23,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:55:23,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:55:23,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:55:23,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:55:23,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (1/1) ... [2022-04-28 10:55:23,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:55:23,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:23,245 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 10:55:23,270 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 10:55:23,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:55:23,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:55:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:55:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:55:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:55:23,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:55:23,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:55:23,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:55:23,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:55:23,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:55:23,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:55:23,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:55:23,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:55:23,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:55:23,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:55:23,361 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:55:23,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:55:23,528 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:55:23,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:55:23,535 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:55:23,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:55:23 BoogieIcfgContainer [2022-04-28 10:55:23,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:55:23,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:55:23,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:55:23,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:55:23,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:55:22" (1/3) ... [2022-04-28 10:55:23,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7806cc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:55:23, skipping insertion in model container [2022-04-28 10:55:23,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:55:23" (2/3) ... [2022-04-28 10:55:23,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7806cc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:55:23, skipping insertion in model container [2022-04-28 10:55:23,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:55:23" (3/3) ... [2022-04-28 10:55:23,561 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll.c [2022-04-28 10:55:23,591 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:55:23,591 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:55:23,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:55:23,654 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@2cfaef60, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7956e1de [2022-04-28 10:55:23,655 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:55:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:55:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:55:23,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:23,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:23,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:23,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2112761405, now seen corresponding path program 1 times [2022-04-28 10:55:23,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275550057] [2022-04-28 10:55:23,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2112761405, now seen corresponding path program 2 times [2022-04-28 10:55:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:23,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047691052] [2022-04-28 10:55:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:23,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:55:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:23,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(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(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:55:23,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:55:23,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-28 10:55:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:55:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:23,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:55:23,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:55:23,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:55:23,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-28 10:55:23,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:55:23,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(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(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:55:23,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:55:23,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-28 10:55:23,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 10:55:23,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-28 10:55:23,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {32#true} is VALID [2022-04-28 10:55:23,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:55:23,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:55:23,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:55:23,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-28 10:55:23,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {33#false} is VALID [2022-04-28 10:55:23,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-28 10:55:23,896 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {33#false} is VALID [2022-04-28 10:55:23,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 10:55:23,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 10:55:23,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 10:55:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047691052] [2022-04-28 10:55:23,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047691052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:23,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:23,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:55:23,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275550057] [2022-04-28 10:55:23,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275550057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:23,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:23,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:55:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891333417] [2022-04-28 10:55:23,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:23,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:23,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:23,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:23,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:55:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:23,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:55:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:55:23,965 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,134 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-04-28 10:55:24,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:55:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-28 10:55:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-28 10:55:24,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-04-28 10:55:24,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:24,276 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:55:24,276 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:55:24,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 10:55:24,283 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:55:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:55:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:55:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:55:24,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:55:24,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:55:24,328 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:55:24,329 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:55:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,334 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:55:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:55:24,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:24,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:24,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-28 10:55:24,336 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-28 10:55:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,341 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:55:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:55:24,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:24,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:24,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:55:24,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:55:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:55:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 10:55:24,356 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-28 10:55:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:55:24,357 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 10:55:24,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 10:55:24,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:55:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:55:24,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:24,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:24,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:55:24,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:24,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1500360061, now seen corresponding path program 1 times [2022-04-28 10:55:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:24,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102845429] [2022-04-28 10:55:24,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1500360061, now seen corresponding path program 2 times [2022-04-28 10:55:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:24,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612025957] [2022-04-28 10:55:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:24,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:24,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:55:24,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1872048188] [2022-04-28 10:55:24,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:55:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:24,439 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 10:55:24,472 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 10:55:24,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:55:24,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:55:24,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:55:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:24,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:55:24,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2022-04-28 10:55:24,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#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(13, 2);call #Ultimate.allocInit(12, 3); {238#true} is VALID [2022-04-28 10:55:24,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-28 10:55:24,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #64#return; {238#true} is VALID [2022-04-28 10:55:24,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret6 := main(); {238#true} is VALID [2022-04-28 10:55:24,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {238#true} is VALID [2022-04-28 10:55:24,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {238#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {238#true} is VALID [2022-04-28 10:55:24,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} ~cond := #in~cond; {238#true} is VALID [2022-04-28 10:55:24,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} assume !(0 == ~cond); {238#true} is VALID [2022-04-28 10:55:24,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-28 10:55:24,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {238#true} {238#true} #58#return; {238#true} is VALID [2022-04-28 10:55:24,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:24,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:24,706 INFO L272 TraceCheckUtils]: 13: Hoare triple {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:55:24,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:24,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {239#false} is VALID [2022-04-28 10:55:24,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-28 10:55:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:24,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:55:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:24,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612025957] [2022-04-28 10:55:24,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:55:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872048188] [2022-04-28 10:55:24,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872048188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:55:24,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:24,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102845429] [2022-04-28 10:55:24,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102845429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:24,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:24,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:55:24,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595650683] [2022-04-28 10:55:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:24,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:24,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:24,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:24,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:55:24,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:24,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:55:24,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:55:24,733 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,909 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 10:55:24,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:55:24,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 10:55:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 10:55:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 10:55:24,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 10:55:24,949 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 10:55:24,950 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:55:24,950 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 10:55:24,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 10:55:24,952 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:55:24,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:55:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 10:55:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-28 10:55:24,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:55:24,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:24,963 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:24,963 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,965 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 10:55:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 10:55:24,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:24,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:24,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 10:55:24,966 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 10:55:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:24,969 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 10:55:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-28 10:55:24,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:24,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:24,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:55:24,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:55:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:24,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 10:55:24,971 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-28 10:55:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:55:24,972 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 10:55:24,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 10:55:24,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 10:55:25,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:55:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:55:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:55:25,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:25,022 INFO L195 NwaCegarLoop]: trace histogram [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 10:55:25,065 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 10:55:25,247 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 10:55:25,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 966896435, now seen corresponding path program 1 times [2022-04-28 10:55:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267367090] [2022-04-28 10:55:25,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:55:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 966896435, now seen corresponding path program 2 times [2022-04-28 10:55:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:25,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215611744] [2022-04-28 10:55:25,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:25,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:55:25,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213675706] [2022-04-28 10:55:25,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:55:25,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:25,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:25,273 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 10:55:25,278 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 10:55:25,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:55:25,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:55:25,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:55:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:25,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:55:25,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {495#true} is VALID [2022-04-28 10:55:25,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#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(13, 2);call #Ultimate.allocInit(12, 3); {495#true} is VALID [2022-04-28 10:55:25,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-28 10:55:25,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #64#return; {495#true} is VALID [2022-04-28 10:55:25,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {495#true} call #t~ret6 := main(); {495#true} is VALID [2022-04-28 10:55:25,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {495#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {495#true} is VALID [2022-04-28 10:55:25,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {495#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {495#true} is VALID [2022-04-28 10:55:25,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#true} ~cond := #in~cond; {521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:55:25,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:25,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {525#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:25,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {525#(not (= |assume_abort_if_not_#in~cond| 0))} {495#true} #58#return; {532#(<= 1 main_~b~0)} is VALID [2022-04-28 10:55:25,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {536#(<= 1 main_~y~0)} is VALID [2022-04-28 10:55:25,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(<= 1 main_~y~0)} assume !false; {536#(<= 1 main_~y~0)} is VALID [2022-04-28 10:55:25,506 INFO L272 TraceCheckUtils]: 13: Hoare triple {536#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {495#true} is VALID [2022-04-28 10:55:25,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-28 10:55:25,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-28 10:55:25,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-28 10:55:25,509 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {495#true} {536#(<= 1 main_~y~0)} #60#return; {536#(<= 1 main_~y~0)} is VALID [2022-04-28 10:55:25,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#(<= 1 main_~y~0)} assume !(0 != ~y~0); {496#false} is VALID [2022-04-28 10:55:25,509 INFO L272 TraceCheckUtils]: 19: Hoare triple {496#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {496#false} is VALID [2022-04-28 10:55:25,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2022-04-28 10:55:25,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {496#false} assume 0 == ~cond; {496#false} is VALID [2022-04-28 10:55:25,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {496#false} assume !false; {496#false} is VALID [2022-04-28 10:55:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:25,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:55:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:55:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215611744] [2022-04-28 10:55:25,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:55:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213675706] [2022-04-28 10:55:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213675706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:25,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:25,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:55:25,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:55:25,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267367090] [2022-04-28 10:55:25,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267367090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:55:25,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:55:25,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:55:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364623791] [2022-04-28 10:55:25,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:55:25,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 10:55:25,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:55:25,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:25,541 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 10:55:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:55:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:25,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:55:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:55:25,542 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:25,738 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-28 10:55:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:55:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 10:55:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:55:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 10:55:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 10:55:25,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 10:55:25,785 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 10:55:25,786 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:55:25,787 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 10:55:25,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:55:25,788 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:55:25,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:55:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 10:55:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-28 10:55:25,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:55:25,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:25,807 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:25,808 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:25,810 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 10:55:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 10:55:25,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:25,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:25,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 10:55:25,811 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 10:55:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:55:25,813 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 10:55:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 10:55:25,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:55:25,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:55:25,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:55:25,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:55:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:55:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 10:55:25,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-28 10:55:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:55:25,817 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 10:55:25,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:55:25,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-28 10:55:25,863 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 10:55:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 10:55:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:55:25,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:55:25,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:55:25,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:55:26,067 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 10:55:26,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:55:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:55:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1614734214, now seen corresponding path program 1 times [2022-04-28 10:55:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:55:26,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987340314] [2022-04-28 10:55:30,188 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:55:30,188 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:55:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1614734214, now seen corresponding path program 2 times [2022-04-28 10:55:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:55:30,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992566369] [2022-04-28 10:55:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:55:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:55:30,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:55:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477228709] [2022-04-28 10:55:30,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:55:30,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:55:30,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:55:30,203 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 10:55:30,262 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 10:55:30,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:55:30,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:55:30,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:55:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:55:30,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:55:38,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 10:55:38,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(13, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-28 10:55:38,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 10:55:38,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 10:55:38,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-28 10:55:38,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-28 10:55:38,622 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-28 10:55:38,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:55:38,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:38,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {811#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:55:38,624 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {811#(not (= |assume_abort_if_not_#in~cond| 0))} {781#true} #58#return; {818#(<= 1 main_~b~0)} is VALID [2022-04-28 10:55:38,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {818#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:38,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:38,625 INFO L272 TraceCheckUtils]: 13: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {781#true} is VALID [2022-04-28 10:55:38,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-28 10:55:38,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-28 10:55:38,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 10:55:38,626 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {781#true} {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:38,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:38,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {847#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:55:38,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {847#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:55:38,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:55:38,633 INFO L272 TraceCheckUtils]: 22: Hoare triple {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:55:38,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:55:38,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 10:55:38,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 10:55:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:55:38,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:56:07,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-28 10:56:07,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-28 10:56:07,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:07,583 INFO L272 TraceCheckUtils]: 22: Hoare triple {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:07,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:56:07,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:56:07,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {885#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 10:56:07,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:56:07,593 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {781#true} {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #60#return; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:56:07,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 10:56:07,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-28 10:56:07,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-28 10:56:07,594 INFO L272 TraceCheckUtils]: 13: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {781#true} is VALID [2022-04-28 10:56:07,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:56:07,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:56:07,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {811#(not (= |assume_abort_if_not_#in~cond| 0))} {781#true} #58#return; {914#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-28 10:56:07,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {811#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:07,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:07,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {927#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 10:56:07,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-28 10:56:07,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-28 10:56:07,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-28 10:56:07,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-28 10:56:07,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-28 10:56:07,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(13, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-28 10:56:07,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-28 10:56:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:56:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:56:07,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992566369] [2022-04-28 10:56:07,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:56:07,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477228709] [2022-04-28 10:56:07,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477228709] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:56:07,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:56:07,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-28 10:56:07,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:56:07,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987340314] [2022-04-28 10:56:07,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987340314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:07,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:07,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:56:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705862492] [2022-04-28 10:56:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:56:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 10:56:07,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:56:07,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:07,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:07,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:56:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:07,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:56:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:56:07,640 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:08,155 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-28 10:56:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:56:08,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 10:56:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:56:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-28 10:56:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-28 10:56:08,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-04-28 10:56:08,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:08,217 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:56:08,217 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 10:56:08,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:56:08,218 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:08,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:56:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 10:56:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-28 10:56:08,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:08,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:56:08,248 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:56:08,248 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:56:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:08,251 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 10:56:08,251 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 10:56:08,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:08,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:08,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 10:56:08,252 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 10:56:08,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:08,254 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 10:56:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 10:56:08,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:08,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:08,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:08,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:56:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 10:56:08,257 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2022-04-28 10:56:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:08,257 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 10:56:08,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:08,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 10:56:08,311 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 10:56:08,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 10:56:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:56:08,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:08,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:08,338 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 10:56:08,512 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 10:56:08,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash -160273148, now seen corresponding path program 1 times [2022-04-28 10:56:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:08,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719612662] [2022-04-28 10:56:11,356 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:56:11,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:56:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -160273148, now seen corresponding path program 2 times [2022-04-28 10:56:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:11,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128268677] [2022-04-28 10:56:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:11,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:11,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851270214] [2022-04-28 10:56:11,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:11,380 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 10:56:11,407 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 10:56:11,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:11,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:11,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:56:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:11,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:56:13,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1217#true} is VALID [2022-04-28 10:56:13,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#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(13, 2);call #Ultimate.allocInit(12, 3); {1217#true} is VALID [2022-04-28 10:56:13,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-28 10:56:13,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1217#true} {1217#true} #64#return; {1217#true} is VALID [2022-04-28 10:56:13,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1217#true} call #t~ret6 := main(); {1217#true} is VALID [2022-04-28 10:56:13,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1217#true} is VALID [2022-04-28 10:56:13,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {1217#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1217#true} is VALID [2022-04-28 10:56:13,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} ~cond := #in~cond; {1243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:56:13,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1247#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:13,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1247#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:56:13,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1247#(not (= |assume_abort_if_not_#in~cond| 0))} {1217#true} #58#return; {1254#(<= 1 main_~b~0)} is VALID [2022-04-28 10:56:13,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:56:13,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:56:13,225 INFO L272 TraceCheckUtils]: 13: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1217#true} is VALID [2022-04-28 10:56:13,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-28 10:56:13,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-28 10:56:13,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-28 10:56:13,226 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1217#true} {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:56:13,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:56:13,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1283#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:56:13,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {1283#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 10:56:13,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 10:56:14,000 INFO L272 TraceCheckUtils]: 22: Hoare triple {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:14,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:14,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1218#false} is VALID [2022-04-28 10:56:14,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} assume !false; {1218#false} is VALID [2022-04-28 10:56:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:56:14,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:56:47,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} assume !false; {1218#false} is VALID [2022-04-28 10:56:47,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1218#false} is VALID [2022-04-28 10:56:47,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:56:47,718 INFO L272 TraceCheckUtils]: 22: Hoare triple {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:56:47,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:56:47,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:56:47,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1321#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 10:56:47,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 10:56:47,728 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1217#true} {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #60#return; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 10:56:47,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-28 10:56:47,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-28 10:56:47,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-28 10:56:47,729 INFO L272 TraceCheckUtils]: 13: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1217#true} is VALID [2022-04-28 10:56:47,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 10:56:47,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 10:56:47,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1217#true} {1217#true} #58#return; {1217#true} is VALID [2022-04-28 10:56:47,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-28 10:56:47,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-28 10:56:47,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {1217#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {1217#true} call #t~ret6 := main(); {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1217#true} {1217#true} #64#return; {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#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(13, 2);call #Ultimate.allocInit(12, 3); {1217#true} is VALID [2022-04-28 10:56:47,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1217#true} is VALID [2022-04-28 10:56:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:56:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:56:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128268677] [2022-04-28 10:56:47,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:56:47,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851270214] [2022-04-28 10:56:47,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851270214] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:56:47,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:56:47,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-04-28 10:56:47,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:56:47,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719612662] [2022-04-28 10:56:47,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719612662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:56:47,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:56:47,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:56:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801369640] [2022-04-28 10:56:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:56:47,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 10:56:47,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:56:47,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:49,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:49,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:56:49,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:49,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:56:49,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:56:49,647 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:50,614 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 10:56:50,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:56:50,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 10:56:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:56:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-28 10:56:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-28 10:56:50,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-28 10:56:50,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:50,657 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:56:50,657 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:56:50,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:56:50,659 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:56:50,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:56:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:56:50,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-04-28 10:56:50,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:56:50,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:56:50,696 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:56:50,696 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:56:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:50,699 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 10:56:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-28 10:56:50,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:50,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:50,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-28 10:56:50,700 INFO L87 Difference]: Start difference. First operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-28 10:56:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:56:50,702 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-28 10:56:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-28 10:56:50,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:56:50,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:56:50,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:56:50,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:56:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:56:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-04-28 10:56:50,705 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2022-04-28 10:56:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:56:50,706 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-04-28 10:56:50,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:56:50,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 54 transitions. [2022-04-28 10:56:50,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:56:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-28 10:56:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:56:50,777 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:56:50,777 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:56:50,794 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 10:56:50,979 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 10:56:50,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:56:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:56:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash 730472692, now seen corresponding path program 1 times [2022-04-28 10:56:50,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:56:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [588273086] [2022-04-28 10:56:55,034 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:56:55,034 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:56:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 730472692, now seen corresponding path program 2 times [2022-04-28 10:56:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:56:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204959444] [2022-04-28 10:56:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:56:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:56:55,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:56:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291977587] [2022-04-28 10:56:55,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:56:55,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:56:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:56:55,054 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:56:55,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:56:55,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:56:55,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:56:55,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:56:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:56:55,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:57:05,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {1695#true} call ULTIMATE.init(); {1695#true} is VALID [2022-04-28 10:57:05,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {1695#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(13, 2);call #Ultimate.allocInit(12, 3); {1695#true} is VALID [2022-04-28 10:57:05,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:05,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1695#true} {1695#true} #64#return; {1695#true} is VALID [2022-04-28 10:57:05,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {1695#true} call #t~ret6 := main(); {1695#true} is VALID [2022-04-28 10:57:05,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {1695#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1695#true} is VALID [2022-04-28 10:57:05,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {1695#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:05,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1695#true} ~cond := #in~cond; {1695#true} is VALID [2022-04-28 10:57:05,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {1695#true} assume !(0 == ~cond); {1695#true} is VALID [2022-04-28 10:57:05,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:05,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1695#true} {1695#true} #58#return; {1695#true} is VALID [2022-04-28 10:57:05,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1695#true} is VALID [2022-04-28 10:57:05,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#true} assume !false; {1695#true} is VALID [2022-04-28 10:57:05,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {1695#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:05,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#true} ~cond := #in~cond; {1695#true} is VALID [2022-04-28 10:57:05,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#true} assume !(0 == ~cond); {1695#true} is VALID [2022-04-28 10:57:05,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:05,397 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1695#true} {1695#true} #60#return; {1695#true} is VALID [2022-04-28 10:57:05,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {1695#true} assume !!(0 != ~y~0); {1695#true} is VALID [2022-04-28 10:57:05,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {1695#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1695#true} is VALID [2022-04-28 10:57:05,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {1695#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1695#true} is VALID [2022-04-28 10:57:05,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {1695#true} assume !false; {1695#true} is VALID [2022-04-28 10:57:05,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {1695#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:05,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {1695#true} ~cond := #in~cond; {1769#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:05,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {1769#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:05,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:07,403 WARN L284 TraceCheckUtils]: 26: Hoare quadruple {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} {1695#true} #60#return; {1780#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-28 10:57:07,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {1780#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1784#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:57:07,405 INFO L272 TraceCheckUtils]: 28: Hoare triple {1784#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:57:07,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:07,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {1792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1696#false} is VALID [2022-04-28 10:57:07,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {1696#false} assume !false; {1696#false} is VALID [2022-04-28 10:57:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:57:07,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:57:21,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {1696#false} assume !false; {1696#false} is VALID [2022-04-28 10:57:21,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {1792#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1696#false} is VALID [2022-04-28 10:57:21,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1792#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:21,050 INFO L272 TraceCheckUtils]: 28: Hoare triple {1784#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1788#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:57:21,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {1811#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1784#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:57:21,052 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} {1695#true} #60#return; {1811#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-28 10:57:21,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:21,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {1824#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1773#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:21,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {1695#true} ~cond := #in~cond; {1824#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:57:21,053 INFO L272 TraceCheckUtils]: 22: Hoare triple {1695#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:21,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {1695#true} assume !false; {1695#true} is VALID [2022-04-28 10:57:21,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {1695#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1695#true} is VALID [2022-04-28 10:57:21,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {1695#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1695#true} is VALID [2022-04-28 10:57:21,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {1695#true} assume !!(0 != ~y~0); {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1695#true} {1695#true} #60#return; {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#true} assume !(0 == ~cond); {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#true} ~cond := #in~cond; {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L272 TraceCheckUtils]: 13: Hoare triple {1695#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#true} assume !false; {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1695#true} is VALID [2022-04-28 10:57:21,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1695#true} {1695#true} #58#return; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1695#true} assume !(0 == ~cond); {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {1695#true} ~cond := #in~cond; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L272 TraceCheckUtils]: 6: Hoare triple {1695#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1695#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {1695#true} call #t~ret6 := main(); {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1695#true} {1695#true} #64#return; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1695#true} assume true; {1695#true} is VALID [2022-04-28 10:57:21,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {1695#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(13, 2);call #Ultimate.allocInit(12, 3); {1695#true} is VALID [2022-04-28 10:57:21,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {1695#true} call ULTIMATE.init(); {1695#true} is VALID [2022-04-28 10:57:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:57:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:57:21,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204959444] [2022-04-28 10:57:21,056 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:57:21,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291977587] [2022-04-28 10:57:21,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291977587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:57:21,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:57:21,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 10:57:21,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:57:21,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [588273086] [2022-04-28 10:57:21,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [588273086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:57:21,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:57:21,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:57:21,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744700186] [2022-04-28 10:57:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:57:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-28 10:57:21,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:57:21,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:57:23,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:23,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:57:23,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:57:23,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:57:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:57:23,083 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:57:25,123 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 10:57:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:25,750 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-28 10:57:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:57:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-28 10:57:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:57:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:57:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 10:57:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:57:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 10:57:25,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 10:57:27,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:27,781 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:57:27,782 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:57:27,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:57:27,783 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:57:27,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 10:57:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:57:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-28 10:57:27,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:57:27,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:57:27,817 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:57:27,817 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:57:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:27,819 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-28 10:57:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-28 10:57:27,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:57:27,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:57:27,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 49 states. [2022-04-28 10:57:27,821 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 49 states. [2022-04-28 10:57:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:57:27,822 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-28 10:57:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-28 10:57:27,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:57:27,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:57:27,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:57:27,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:57:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:57:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-28 10:57:27,825 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 32 [2022-04-28 10:57:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:57:27,825 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-28 10:57:27,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:57:27,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-28 10:57:35,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 46 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 10:57:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-28 10:57:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:57:35,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:57:35,945 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:57:35,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:57:36,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:57:36,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:57:36,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:57:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1040303587, now seen corresponding path program 3 times [2022-04-28 10:57:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:57:36,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289612756] [2022-04-28 10:57:39,162 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:57:39,163 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:57:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1040303587, now seen corresponding path program 4 times [2022-04-28 10:57:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:57:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647244394] [2022-04-28 10:57:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:57:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:57:39,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:57:39,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48697924] [2022-04-28 10:57:39,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:57:39,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:57:39,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:57:39,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:57:39,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:57:39,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:57:39,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:57:39,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:57:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:57:39,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:57:48,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2022-04-28 10:57:48,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {2204#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(13, 2);call #Ultimate.allocInit(12, 3); {2204#true} is VALID [2022-04-28 10:57:48,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2022-04-28 10:57:48,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #64#return; {2204#true} is VALID [2022-04-28 10:57:48,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret6 := main(); {2204#true} is VALID [2022-04-28 10:57:48,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2204#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2204#true} is VALID [2022-04-28 10:57:48,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {2204#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:57:48,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {2204#true} ~cond := #in~cond; {2230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:57:48,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2234#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:57:48,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2234#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:57:48,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2234#(not (= |assume_abort_if_not_#in~cond| 0))} {2204#true} #58#return; {2241#(<= 1 main_~b~0)} is VALID [2022-04-28 10:57:48,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {2241#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:57:48,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:57:48,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:57:48,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2204#true} ~cond := #in~cond; {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:48,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {2255#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:48,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:57:48,674 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:57:48,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:57:48,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {2245#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2272#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:57:48,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {2272#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,677 INFO L272 TraceCheckUtils]: 22: Hoare triple {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:57:48,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {2204#true} ~cond := #in~cond; {2204#true} is VALID [2022-04-28 10:57:48,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {2204#true} assume !(0 == ~cond); {2204#true} is VALID [2022-04-28 10:57:48,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {2204#true} assume true; {2204#true} is VALID [2022-04-28 10:57:48,678 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2204#true} {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #60#return; {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {2276#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2301#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {2301#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2305#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2305#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:57:48,684 INFO L272 TraceCheckUtils]: 31: Hoare triple {2305#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:57:48,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {2312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:57:48,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {2316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2205#false} is VALID [2022-04-28 10:57:48,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {2205#false} assume !false; {2205#false} is VALID [2022-04-28 10:57:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:57:48,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:58:36,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {2205#false} assume !false; {2205#false} is VALID [2022-04-28 10:58:36,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {2316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2205#false} is VALID [2022-04-28 10:58:36,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {2312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:58:36,640 INFO L272 TraceCheckUtils]: 31: Hoare triple {2332#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:58:36,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {2332#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2332#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:58:36,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {2339#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2332#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 10:58:36,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2339#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 10:58:36,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:58:36,648 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2204#true} {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #60#return; {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:58:36,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {2204#true} assume true; {2204#true} is VALID [2022-04-28 10:58:36,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {2204#true} assume !(0 == ~cond); {2204#true} is VALID [2022-04-28 10:58:36,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {2204#true} ~cond := #in~cond; {2204#true} is VALID [2022-04-28 10:58:36,649 INFO L272 TraceCheckUtils]: 22: Hoare triple {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:58:36,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:58:36,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {2368#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2343#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 10:58:36,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {2372#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2368#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} is VALID [2022-04-28 10:58:36,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !!(0 != ~y~0); {2372#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-28 10:58:36,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} {2379#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} #60#return; {2372#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-28 10:58:36,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:58:36,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {2389#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2259#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:58:36,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {2204#true} ~cond := #in~cond; {2389#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:58:36,682 INFO L272 TraceCheckUtils]: 13: Hoare triple {2379#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:58:36,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {2379#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} assume !false; {2379#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-28 10:58:36,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {2399#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2379#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-28 10:58:36,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2234#(not (= |assume_abort_if_not_#in~cond| 0))} {2204#true} #58#return; {2399#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} is VALID [2022-04-28 10:58:36,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2234#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:58:36,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {2412#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2234#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:58:36,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {2204#true} ~cond := #in~cond; {2412#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 10:58:36,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {2204#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2204#true} is VALID [2022-04-28 10:58:36,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {2204#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2204#true} is VALID [2022-04-28 10:58:36,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {2204#true} call #t~ret6 := main(); {2204#true} is VALID [2022-04-28 10:58:36,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2204#true} {2204#true} #64#return; {2204#true} is VALID [2022-04-28 10:58:36,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {2204#true} assume true; {2204#true} is VALID [2022-04-28 10:58:36,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {2204#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(13, 2);call #Ultimate.allocInit(12, 3); {2204#true} is VALID [2022-04-28 10:58:36,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {2204#true} call ULTIMATE.init(); {2204#true} is VALID [2022-04-28 10:58:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:58:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:58:36,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647244394] [2022-04-28 10:58:36,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:58:36,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48697924] [2022-04-28 10:58:36,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48697924] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:58:36,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:58:36,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-04-28 10:58:36,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:58:36,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289612756] [2022-04-28 10:58:36,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289612756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:58:36,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:58:36,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:58:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178907023] [2022-04-28 10:58:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:58:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 10:58:36,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:58:36,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:36,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:36,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:58:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:58:36,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:58:36,719 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:37,949 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 10:58:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:58:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 10:58:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:58:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:58:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-28 10:58:37,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-28 10:58:38,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 10:58:38,004 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:58:38,004 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 10:58:38,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:58:38,005 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:58:38,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 140 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:58:38,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 10:58:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-04-28 10:58:38,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:58:38,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:38,047 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:38,047 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:38,049 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-28 10:58:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-28 10:58:38,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:38,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:38,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 59 states. [2022-04-28 10:58:38,050 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 59 states. [2022-04-28 10:58:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:58:38,052 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-04-28 10:58:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-28 10:58:38,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:58:38,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:58:38,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:58:38,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:58:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:58:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 10:58:38,055 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2022-04-28 10:58:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:58:38,055 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 10:58:38,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 10:58:38,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 10:58:48,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 55 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 10:58:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 10:58:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:58:48,225 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:58:48,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:58:48,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:58:48,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:48,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:58:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:58:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash -734703775, now seen corresponding path program 1 times [2022-04-28 10:58:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:58:48,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [295412892] [2022-04-28 10:58:54,814 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:58:54,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:58:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -734703775, now seen corresponding path program 2 times [2022-04-28 10:58:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:58:54,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237762374] [2022-04-28 10:58:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:58:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:58:54,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:58:54,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969657594] [2022-04-28 10:58:54,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:58:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:58:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:58:54,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:58:54,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:58:54,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:58:54,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:58:54,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:58:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:58:54,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:17,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {2794#true} call ULTIMATE.init(); {2794#true} is VALID [2022-04-28 10:59:17,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#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(13, 2);call #Ultimate.allocInit(12, 3); {2794#true} is VALID [2022-04-28 10:59:17,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2794#true} assume true; {2794#true} is VALID [2022-04-28 10:59:17,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2794#true} {2794#true} #64#return; {2794#true} is VALID [2022-04-28 10:59:17,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {2794#true} call #t~ret6 := main(); {2794#true} is VALID [2022-04-28 10:59:17,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2794#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2794#true} is VALID [2022-04-28 10:59:17,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {2794#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2794#true} is VALID [2022-04-28 10:59:17,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#true} ~cond := #in~cond; {2820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 10:59:17,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {2820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:59:17,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {2824#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 10:59:17,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2824#(not (= |assume_abort_if_not_#in~cond| 0))} {2794#true} #58#return; {2831#(<= 1 main_~b~0)} is VALID [2022-04-28 10:59:17,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {2831#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:59:17,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:59:17,154 INFO L272 TraceCheckUtils]: 13: Hoare triple {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2794#true} is VALID [2022-04-28 10:59:17,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {2794#true} ~cond := #in~cond; {2845#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:17,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {2845#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:17,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:17,155 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:59:17,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:59:17,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2835#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2862#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 10:59:17,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {2862#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:59:17,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:59:17,158 INFO L272 TraceCheckUtils]: 22: Hoare triple {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2794#true} is VALID [2022-04-28 10:59:17,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {2794#true} ~cond := #in~cond; {2794#true} is VALID [2022-04-28 10:59:17,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {2794#true} assume !(0 == ~cond); {2794#true} is VALID [2022-04-28 10:59:17,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {2794#true} assume true; {2794#true} is VALID [2022-04-28 10:59:17,163 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2794#true} {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #60#return; {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:59:17,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 10:59:17,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {2866#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2891#(and (= main_~z~0 main_~x~0) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-28 10:59:17,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {2891#(and (= main_~z~0 main_~x~0) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2895#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-28 10:59:17,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {2895#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !false; {2895#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-28 10:59:17,388 INFO L272 TraceCheckUtils]: 31: Hoare triple {2895#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2902#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:17,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {2902#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2906#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:17,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {2906#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2795#false} is VALID [2022-04-28 10:59:17,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {2795#false} assume !false; {2795#false} is VALID [2022-04-28 10:59:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:59:17,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:02:07,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {2795#false} assume !false; {2795#false} is VALID [2022-04-28 11:02:07,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {2906#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2795#false} is VALID [2022-04-28 11:02:07,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {2902#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2906#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:07,990 INFO L272 TraceCheckUtils]: 31: Hoare triple {2922#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2902#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:02:07,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {2922#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2922#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:02:07,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {2929#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2922#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:02:07,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2929#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 11:02:07,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 11:02:07,999 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2794#true} {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #60#return; {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 11:02:07,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {2794#true} assume true; {2794#true} is VALID [2022-04-28 11:02:07,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {2794#true} assume !(0 == ~cond); {2794#true} is VALID [2022-04-28 11:02:07,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {2794#true} ~cond := #in~cond; {2794#true} is VALID [2022-04-28 11:02:07,999 INFO L272 TraceCheckUtils]: 22: Hoare triple {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2794#true} is VALID [2022-04-28 11:02:08,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 11:02:08,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {2958#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (< (div main_~y~0 2) 0) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2933#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-28 11:02:08,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2958#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (< (div main_~y~0 2) 0) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))} is VALID [2022-04-28 11:02:08,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {2962#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} assume !!(0 != ~y~0); {2962#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} is VALID [2022-04-28 11:02:08,266 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} {2794#true} #60#return; {2962#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} is VALID [2022-04-28 11:02:08,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:08,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {2978#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {2794#true} ~cond := #in~cond; {2978#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:02:08,268 INFO L272 TraceCheckUtils]: 13: Hoare triple {2794#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {2794#true} assume !false; {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {2794#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2794#true} {2794#true} #58#return; {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2794#true} assume true; {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#true} assume !(0 == ~cond); {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#true} ~cond := #in~cond; {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {2794#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2794#true} is VALID [2022-04-28 11:02:08,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {2794#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {2794#true} call #t~ret6 := main(); {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2794#true} {2794#true} #64#return; {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2794#true} assume true; {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#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(13, 2);call #Ultimate.allocInit(12, 3); {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {2794#true} call ULTIMATE.init(); {2794#true} is VALID [2022-04-28 11:02:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 11:02:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:02:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237762374] [2022-04-28 11:02:08,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:02:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969657594] [2022-04-28 11:02:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969657594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:02:08,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:02:08,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-28 11:02:08,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:02:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [295412892] [2022-04-28 11:02:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [295412892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:02:08,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:02:08,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:02:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851176985] [2022-04-28 11:02:08,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:02:08,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 11:02:08,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:02:08,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:02:08,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:08,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:02:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:08,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:02:08,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 11:02:08,431 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:02:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:12,088 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-04-28 11:02:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:02:12,089 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 11:02:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:02:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:02:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 11:02:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:02:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 11:02:12,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-28 11:02:12,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:12,420 INFO L225 Difference]: With dead ends: 68 [2022-04-28 11:02:12,420 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 11:02:12,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:02:12,421 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:02:12,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 134 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 11:02:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 11:02:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-04-28 11:02:12,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:02:12,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:02:12,460 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:02:12,460 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:02:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:12,462 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-28 11:02:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-28 11:02:12,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:12,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:12,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 11:02:12,463 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 11:02:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:02:12,465 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-04-28 11:02:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-04-28 11:02:12,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:02:12,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:02:12,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:02:12,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:02:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:02:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 11:02:12,468 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2022-04-28 11:02:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:02:12,468 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 11:02:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:02:12,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 11:02:22,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 55 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 11:02:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 11:02:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 11:02:22,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:02:22,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:02:22,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 11:02:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:23,121 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:02:23,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:02:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2061371941, now seen corresponding path program 3 times [2022-04-28 11:02:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:02:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165410022] [2022-04-28 11:02:29,230 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:02:29,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:02:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2061371941, now seen corresponding path program 4 times [2022-04-28 11:02:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:02:29,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685831569] [2022-04-28 11:02:29,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:02:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:02:29,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:02:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329317670] [2022-04-28 11:02:29,241 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:02:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:02:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:02:29,252 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:02:29,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 11:02:29,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:02:29,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:02:29,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:02:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:02:29,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:02:35,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2022-04-28 11:02:35,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {3409#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(13, 2);call #Ultimate.allocInit(12, 3); {3409#true} is VALID [2022-04-28 11:02:35,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:02:35,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #64#return; {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret6 := main(); {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {3409#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L272 TraceCheckUtils]: 6: Hoare triple {3409#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:02:35,151 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3409#true} {3409#true} #58#return; {3409#true} is VALID [2022-04-28 11:02:35,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {3409#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 11:02:35,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 11:02:35,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:02:35,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2022-04-28 11:02:35,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2022-04-28 11:02:35,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:02:35,158 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3409#true} {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #60#return; {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 11:02:35,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {3447#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3469#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 11:02:35,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {3469#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3473#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 11:02:35,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {3473#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 11:02:35,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 11:02:35,161 INFO L272 TraceCheckUtils]: 22: Hoare triple {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:02:35,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {3409#true} ~cond := #in~cond; {3487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:35,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {3487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:35,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:35,163 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #60#return; {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 11:02:35,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 11:02:35,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {3477#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3504#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-28 11:02:35,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {3504#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3508#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-28 11:02:35,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {3508#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !false; {3508#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-28 11:02:35,325 INFO L272 TraceCheckUtils]: 31: Hoare triple {3508#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:02:35,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {3515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:35,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {3519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3410#false} is VALID [2022-04-28 11:02:35,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2022-04-28 11:02:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 11:02:35,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:18,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2022-04-28 11:05:18,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {3519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3410#false} is VALID [2022-04-28 11:05:18,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {3515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:18,170 INFO L272 TraceCheckUtils]: 31: Hoare triple {3535#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:18,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {3535#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3535#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:05:18,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {3542#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3535#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:05:18,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {3546#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3542#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 11:05:18,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {3546#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3546#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 11:05:18,183 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} {3553#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #60#return; {3546#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 11:05:18,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:18,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {3563#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:18,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {3409#true} ~cond := #in~cond; {3563#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:05:18,184 INFO L272 TraceCheckUtils]: 22: Hoare triple {3553#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:05:18,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {3553#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {3553#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-28 11:05:18,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#(forall ((aux_div_v_main_~y~0_79_22 Int)) (or (and (or (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_79_22 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (<= (+ (* aux_div_v_main_~y~0_79_22 2) 1) (div main_~y~0 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (<= (+ 2 (* aux_div_v_main_~y~0_79_22 2)) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_79_22 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* aux_div_v_main_~y~0_79_22 main_~x~0)) main_~z~0 (* main_~x~0 4)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3553#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {3409#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3573#(forall ((aux_div_v_main_~y~0_79_22 Int)) (or (and (or (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_79_22 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (<= (+ (* aux_div_v_main_~y~0_79_22 2) 1) (div main_~y~0 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (<= (+ 2 (* aux_div_v_main_~y~0_79_22 2)) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_79_22 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* aux_div_v_main_~y~0_79_22 main_~x~0)) main_~z~0 (* main_~x~0 4)))))} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {3409#true} assume !!(0 != ~y~0); {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3409#true} {3409#true} #60#return; {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L272 TraceCheckUtils]: 13: Hoare triple {3409#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {3409#true} assume !false; {3409#true} is VALID [2022-04-28 11:05:18,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {3409#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3409#true} {3409#true} #58#return; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {3409#true} assume !(0 == ~cond); {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {3409#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {3409#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret6 := main(); {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #64#return; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {3409#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(13, 2);call #Ultimate.allocInit(12, 3); {3409#true} is VALID [2022-04-28 11:05:18,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2022-04-28 11:05:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 11:05:18,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:18,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685831569] [2022-04-28 11:05:18,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:18,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329317670] [2022-04-28 11:05:18,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329317670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:18,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:18,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-28 11:05:18,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165410022] [2022-04-28 11:05:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165410022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:18,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:18,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:05:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445556193] [2022-04-28 11:05:18,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 11:05:18,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:18,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:05:18,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:18,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:05:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:18,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:05:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=244, Unknown=2, NotChecked=0, Total=306 [2022-04-28 11:05:18,536 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:05:22,830 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 11:05:26,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:05:30,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:05:36,755 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:05:40,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:05:42,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:05:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:45,099 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-28 11:05:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:05:45,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 11:05:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:05:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:05:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2022-04-28 11:05:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:05:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 51 transitions. [2022-04-28 11:05:45,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 51 transitions. [2022-04-28 11:05:45,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:45,278 INFO L225 Difference]: With dead ends: 73 [2022-04-28 11:05:45,278 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 11:05:45,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=73, Invalid=305, Unknown=2, NotChecked=0, Total=380 [2022-04-28 11:05:45,279 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:05:45,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 1 Unknown, 0 Unchecked, 14.5s Time] [2022-04-28 11:05:45,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 11:05:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-04-28 11:05:45,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:05:45,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:05:45,347 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:05:45,347 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:05:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:45,349 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-28 11:05:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-04-28 11:05:45,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:45,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:45,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-28 11:05:45,350 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-28 11:05:45,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:05:45,352 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-28 11:05:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-04-28 11:05:45,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:05:45,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:05:45,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:05:45,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:05:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 11:05:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-04-28 11:05:45,356 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 35 [2022-04-28 11:05:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:05:45,356 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-04-28 11:05:45,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 11:05:45,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 67 transitions. [2022-04-28 11:05:59,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 61 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-04-28 11:05:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 11:05:59,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:05:59,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:05:59,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:05:59,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 11:05:59,668 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:05:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:05:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1326136358, now seen corresponding path program 5 times [2022-04-28 11:05:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:59,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2059917802] [2022-04-28 11:06:03,711 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:06:03,711 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:06:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1326136358, now seen corresponding path program 6 times [2022-04-28 11:06:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:06:03,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761719732] [2022-04-28 11:06:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:06:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:06:03,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:06:03,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103767506] [2022-04-28 11:06:03,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:06:03,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:06:03,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:06:03,724 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:06:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:06:03,811 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 11:06:03,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:06:03,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 11:06:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:06:03,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:06:36,418 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:06:40,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {4050#true} call ULTIMATE.init(); {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#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(13, 2);call #Ultimate.allocInit(12, 3); {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4050#true} {4050#true} #64#return; {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {4050#true} call #t~ret6 := main(); {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {4050#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {4050#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:06:40,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {4050#true} ~cond := #in~cond; {4076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:06:40,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {4076#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:06:40,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:06:40,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4080#(not (= |assume_abort_if_not_#in~cond| 0))} {4050#true} #58#return; {4087#(<= 1 main_~b~0)} is VALID [2022-04-28 11:06:40,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !false; {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,042 INFO L272 TraceCheckUtils]: 13: Hoare triple {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:06:40,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#true} ~cond := #in~cond; {4050#true} is VALID [2022-04-28 11:06:40,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {4050#true} assume !(0 == ~cond); {4050#true} is VALID [2022-04-28 11:06:40,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:06:40,043 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4050#true} {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} #60#return; {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {4091#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4116#(and (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4116#(and (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4120#(and (<= 1 main_~b~0) (exists ((aux_mod_v_main_~y~0_85_22 Int) (aux_div_v_main_~y~0_85_22 Int)) (and (< aux_mod_v_main_~y~0_85_22 2) (<= (div (+ (* aux_div_v_main_~y~0_85_22 2) aux_mod_v_main_~y~0_85_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_85_22 1)) (<= 0 aux_mod_v_main_~y~0_85_22) (<= main_~b~0 (+ (* aux_div_v_main_~y~0_85_22 2) aux_mod_v_main_~y~0_85_22)))))} is VALID [2022-04-28 11:06:40,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {4120#(and (<= 1 main_~b~0) (exists ((aux_mod_v_main_~y~0_85_22 Int) (aux_div_v_main_~y~0_85_22 Int)) (and (< aux_mod_v_main_~y~0_85_22 2) (<= (div (+ (* aux_div_v_main_~y~0_85_22 2) aux_mod_v_main_~y~0_85_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_85_22 1)) (<= 0 aux_mod_v_main_~y~0_85_22) (<= main_~b~0 (+ (* aux_div_v_main_~y~0_85_22 2) aux_mod_v_main_~y~0_85_22)))))} assume !false; {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,048 INFO L272 TraceCheckUtils]: 22: Hoare triple {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:06:40,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {4050#true} ~cond := #in~cond; {4050#true} is VALID [2022-04-28 11:06:40,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {4050#true} assume !(0 == ~cond); {4050#true} is VALID [2022-04-28 11:06:40,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:06:40,050 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4050#true} {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} #60#return; {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {4124#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4146#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~y~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {4146#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~y~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4150#(and (<= 1 main_~b~0) (exists ((aux_div_v_main_~y~0_86_22 Int) (aux_mod_v_main_~y~0_86_22 Int)) (and (<= (div (+ (* aux_div_v_main_~y~0_86_22 2) aux_mod_v_main_~y~0_86_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_86_22 1)) (< (div (* (- 1) main_~b~0) (- 2)) (+ (* aux_div_v_main_~y~0_86_22 2) aux_mod_v_main_~y~0_86_22 1)) (<= 0 aux_mod_v_main_~y~0_86_22) (< aux_mod_v_main_~y~0_86_22 2))))} is VALID [2022-04-28 11:06:40,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {4150#(and (<= 1 main_~b~0) (exists ((aux_div_v_main_~y~0_86_22 Int) (aux_mod_v_main_~y~0_86_22 Int)) (and (<= (div (+ (* aux_div_v_main_~y~0_86_22 2) aux_mod_v_main_~y~0_86_22) 2) main_~y~0) (not (= aux_mod_v_main_~y~0_86_22 1)) (< (div (* (- 1) main_~b~0) (- 2)) (+ (* aux_div_v_main_~y~0_86_22 2) aux_mod_v_main_~y~0_86_22 1)) (<= 0 aux_mod_v_main_~y~0_86_22) (< aux_mod_v_main_~y~0_86_22 2))))} assume !false; {4154#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,056 INFO L272 TraceCheckUtils]: 31: Hoare triple {4154#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:06:40,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {4050#true} ~cond := #in~cond; {4161#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:06:40,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {4161#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:40,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:06:40,058 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} {4154#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} #60#return; {4172#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {4172#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4172#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {4172#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4179#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-28 11:06:40,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {4179#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4183#(and (exists ((aux_div_v_main_~y~0_87_22 Int) (aux_mod_v_main_~y~0_87_22 Int)) (and (= (+ main_~z~0 (* (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2)) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2) 1)) (<= 0 aux_mod_v_main_~y~0_87_22) (not (= aux_mod_v_main_~y~0_87_22 1)) (= (div (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2)) 2) main_~y~0) (< aux_mod_v_main_~y~0_87_22 2))) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 11:06:40,466 INFO L290 TraceCheckUtils]: 39: Hoare triple {4183#(and (exists ((aux_div_v_main_~y~0_87_22 Int) (aux_mod_v_main_~y~0_87_22 Int)) (and (= (+ main_~z~0 (* (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2)) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2) 1)) (<= 0 aux_mod_v_main_~y~0_87_22) (not (= aux_mod_v_main_~y~0_87_22 1)) (= (div (+ aux_mod_v_main_~y~0_87_22 (* aux_div_v_main_~y~0_87_22 2)) 2) main_~y~0) (< aux_mod_v_main_~y~0_87_22 2))) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {4187#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 11:06:41,154 INFO L272 TraceCheckUtils]: 40: Hoare triple {4187#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:06:41,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {4191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:06:41,155 INFO L290 TraceCheckUtils]: 42: Hoare triple {4195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4051#false} is VALID [2022-04-28 11:06:41,155 INFO L290 TraceCheckUtils]: 43: Hoare triple {4051#false} assume !false; {4051#false} is VALID [2022-04-28 11:06:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:06:41,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:07:18,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {4051#false} assume !false; {4051#false} is VALID [2022-04-28 11:07:18,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {4195#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4051#false} is VALID [2022-04-28 11:07:18,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {4191#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4195#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:07:18,771 INFO L272 TraceCheckUtils]: 40: Hoare triple {4211#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4191#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:07:18,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {4211#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4211#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:07:18,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {4218#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4211#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-28 11:07:18,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {4222#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4218#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-28 11:07:18,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {4222#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4222#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 11:07:18,787 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} {4229#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #60#return; {4222#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-28 11:07:18,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:07:18,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {4239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:07:18,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {4050#true} ~cond := #in~cond; {4239#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:07:18,788 INFO L272 TraceCheckUtils]: 31: Hoare triple {4229#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:07:18,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {4229#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4229#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 11:07:18,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4229#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-28 11:07:18,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-28 11:07:18,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-28 11:07:18,791 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4050#true} {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #60#return; {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-28 11:07:18,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:07:18,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {4050#true} assume !(0 == ~cond); {4050#true} is VALID [2022-04-28 11:07:18,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {4050#true} ~cond := #in~cond; {4050#true} is VALID [2022-04-28 11:07:18,795 INFO L272 TraceCheckUtils]: 22: Hoare triple {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:07:18,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-28 11:07:18,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4249#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-28 11:07:18,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-28 11:07:18,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !!(0 != ~y~0); {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-28 11:07:18,800 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4050#true} {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} #60#return; {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-28 11:07:18,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:07:18,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {4050#true} assume !(0 == ~cond); {4050#true} is VALID [2022-04-28 11:07:18,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {4050#true} ~cond := #in~cond; {4050#true} is VALID [2022-04-28 11:07:18,800 INFO L272 TraceCheckUtils]: 13: Hoare triple {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:07:18,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !false; {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-28 11:07:18,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#(<= 0 (+ 3 (div (+ (- 1) (div (+ (div (+ (- 11) main_~b~0) 2) (- 3)) 2)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4277#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-28 11:07:18,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4080#(not (= |assume_abort_if_not_#in~cond| 0))} {4050#true} #58#return; {4305#(<= 0 (+ 3 (div (+ (- 1) (div (+ (div (+ (- 11) main_~b~0) 2) (- 3)) 2)) 2)))} is VALID [2022-04-28 11:07:18,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:07:18,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {4318#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4080#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:07:18,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {4050#true} ~cond := #in~cond; {4318#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 11:07:18,804 INFO L272 TraceCheckUtils]: 6: Hoare triple {4050#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {4050#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {4050#true} call #t~ret6 := main(); {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4050#true} {4050#true} #64#return; {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {4050#true} assume true; {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {4050#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(13, 2);call #Ultimate.allocInit(12, 3); {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {4050#true} call ULTIMATE.init(); {4050#true} is VALID [2022-04-28 11:07:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 11:07:18,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:07:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761719732] [2022-04-28 11:07:18,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:07:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103767506] [2022-04-28 11:07:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103767506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:07:18,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:07:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 29 [2022-04-28 11:07:18,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:07:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2059917802] [2022-04-28 11:07:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2059917802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:07:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:07:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 11:07:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842627302] [2022-04-28 11:07:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:07:18,807 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-04-28 11:07:18,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:07:18,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:07:21,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:07:21,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 11:07:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:07:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 11:07:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=655, Unknown=6, NotChecked=0, Total=812 [2022-04-28 11:07:21,696 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:07:24,286 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 11:07:33,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:07:35,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:07:39,995 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 11:07:42,005 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 11:07:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:07:42,058 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-28 11:07:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 11:07:42,058 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-04-28 11:07:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:07:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:07:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2022-04-28 11:07:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:07:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2022-04-28 11:07:42,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 53 transitions. [2022-04-28 11:07:47,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:07:47,481 INFO L225 Difference]: With dead ends: 79 [2022-04-28 11:07:47,481 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 11:07:47,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=270, Invalid=1129, Unknown=7, NotChecked=0, Total=1406 [2022-04-28 11:07:47,482 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:07:47,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 111 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 146 Invalid, 3 Unknown, 25 Unchecked, 11.1s Time] [2022-04-28 11:07:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 11:07:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-04-28 11:07:47,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:07:47,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:07:47,574 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:07:47,574 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:07:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:07:47,576 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-28 11:07:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-04-28 11:07:47,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:07:47,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:07:47,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-28 11:07:47,577 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 77 states. [2022-04-28 11:07:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:07:47,579 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-28 11:07:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-04-28 11:07:47,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:07:47,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:07:47,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:07:47,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:07:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 11:07:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-28 11:07:47,581 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 44 [2022-04-28 11:07:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:07:47,581 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-28 11:07:47,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 11:07:47,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 77 transitions. [2022-04-28 11:08:06,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 70 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-28 11:08:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-28 11:08:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 11:08:06,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:08:06,959 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:08:06,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 11:08:07,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:08:07,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:08:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:08:07,164 INFO L85 PathProgramCache]: Analyzing trace with hash -448871004, now seen corresponding path program 5 times [2022-04-28 11:08:07,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:08:07,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [764026272] [2022-04-28 11:08:09,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:08:09,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:08:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -448871004, now seen corresponding path program 6 times [2022-04-28 11:08:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:08:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589264127] [2022-04-28 11:08:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:08:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:08:09,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:08:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218629794] [2022-04-28 11:08:09,997 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:08:09,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:08:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:08:10,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:08:10,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:08:10,045 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:08:10,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:08:10,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 11:08:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:08:10,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:08:27,792 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:08:43,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {4815#true} call ULTIMATE.init(); {4815#true} is VALID [2022-04-28 11:08:43,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {4815#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(13, 2);call #Ultimate.allocInit(12, 3); {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {4815#true} assume true; {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4815#true} {4815#true} #64#return; {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {4815#true} call #t~ret6 := main(); {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {4815#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {4815#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {4815#true} ~cond := #in~cond; {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {4815#true} assume !(0 == ~cond); {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {4815#true} assume true; {4815#true} is VALID [2022-04-28 11:08:43,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4815#true} {4815#true} #58#return; {4815#true} is VALID [2022-04-28 11:08:43,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {4815#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {4853#(= main_~z~0 0)} assume !false; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,553 INFO L272 TraceCheckUtils]: 13: Hoare triple {4853#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4815#true} is VALID [2022-04-28 11:08:43,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {4815#true} ~cond := #in~cond; {4815#true} is VALID [2022-04-28 11:08:43,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {4815#true} assume !(0 == ~cond); {4815#true} is VALID [2022-04-28 11:08:43,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {4815#true} assume true; {4815#true} is VALID [2022-04-28 11:08:43,554 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4815#true} {4853#(= main_~z~0 0)} #60#return; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {4853#(= main_~z~0 0)} assume !!(0 != ~y~0); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {4853#(= main_~z~0 0)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {4853#(= main_~z~0 0)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {4853#(= main_~z~0 0)} assume !false; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,555 INFO L272 TraceCheckUtils]: 22: Hoare triple {4853#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4815#true} is VALID [2022-04-28 11:08:43,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4815#true} ~cond := #in~cond; {4815#true} is VALID [2022-04-28 11:08:43,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {4815#true} assume !(0 == ~cond); {4815#true} is VALID [2022-04-28 11:08:43,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {4815#true} assume true; {4815#true} is VALID [2022-04-28 11:08:43,556 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4815#true} {4853#(= main_~z~0 0)} #60#return; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {4853#(= main_~z~0 0)} assume !!(0 != ~y~0); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {4853#(= main_~z~0 0)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {4853#(= main_~z~0 0)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4853#(= main_~z~0 0)} assume !false; {4853#(= main_~z~0 0)} is VALID [2022-04-28 11:08:43,557 INFO L272 TraceCheckUtils]: 31: Hoare triple {4853#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4815#true} is VALID [2022-04-28 11:08:43,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {4815#true} ~cond := #in~cond; {4917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:08:43,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {4917#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:08:43,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {4921#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4921#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:08:43,558 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4921#(not (= |__VERIFIER_assert_#in~cond| 0))} {4853#(= main_~z~0 0)} #60#return; {4928#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-28 11:08:43,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {4928#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} assume !!(0 != ~y~0); {4932#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-28 11:08:43,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {4932#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4936#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~z~0 main_~x~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-28 11:08:43,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {4936#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~z~0 main_~x~0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4940#(and (exists ((aux_mod_v_main_~y~0_104_29 Int) (aux_div_v_main_~y~0_104_29 Int)) (and (<= 0 (+ (* 2 aux_div_v_main_~y~0_104_29) aux_mod_v_main_~y~0_104_29)) (= (+ (* 2 (* main_~z~0 aux_div_v_main_~y~0_104_29)) (* main_~z~0 aux_mod_v_main_~y~0_104_29)) (* main_~b~0 main_~a~0)) (<= 1 aux_mod_v_main_~y~0_104_29) (= (div (+ (* 2 aux_div_v_main_~y~0_104_29) (- 1) aux_mod_v_main_~y~0_104_29) 2) main_~y~0) (< aux_mod_v_main_~y~0_104_29 2))) (= main_~x~0 (* main_~z~0 2)))} is VALID [2022-04-28 11:08:45,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#(and (exists ((aux_mod_v_main_~y~0_104_29 Int) (aux_div_v_main_~y~0_104_29 Int)) (and (<= 0 (+ (* 2 aux_div_v_main_~y~0_104_29) aux_mod_v_main_~y~0_104_29)) (= (+ (* 2 (* main_~z~0 aux_div_v_main_~y~0_104_29)) (* main_~z~0 aux_mod_v_main_~y~0_104_29)) (* main_~b~0 main_~a~0)) (<= 1 aux_mod_v_main_~y~0_104_29) (= (div (+ (* 2 aux_div_v_main_~y~0_104_29) (- 1) aux_mod_v_main_~y~0_104_29) 2) main_~y~0) (< aux_mod_v_main_~y~0_104_29 2))) (= main_~x~0 (* main_~z~0 2)))} assume !false; {4944#(and (= (+ main_~z~0 (* 2 (* main_~z~0 main_~y~0))) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 11:08:45,420 INFO L272 TraceCheckUtils]: 40: Hoare triple {4944#(and (= (+ main_~z~0 (* 2 (* main_~z~0 main_~y~0))) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4948#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:08:45,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {4948#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4952#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:08:45,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {4952#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4816#false} is VALID [2022-04-28 11:08:45,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {4816#false} assume !false; {4816#false} is VALID [2022-04-28 11:08:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 11:08:45,421 INFO L328 TraceCheckSpWp]: Computing backward predicates...