/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:27:10,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:27:10,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:27:10,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:27:10,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:27:10,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:27:10,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:27:10,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:27:10,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:27:10,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:27:10,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:27:10,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:27:10,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:27:10,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:27:10,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:27:10,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:27:10,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:27:10,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:27:10,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:27:10,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:27:10,459 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:27:10,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:27:10,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:27:10,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:27:10,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:27:10,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:27:10,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:27:10,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:27:10,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:27:10,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:27:10,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:27:10,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:27:10,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:27:10,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:27:10,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:27:10,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:27:10,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:27:10,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:27:10,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:27:10,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:27:10,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:27:10,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:27:10,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 14:27:10,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:27:10,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:27:10,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:27:10,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:27:10,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:27:10,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:27:10,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:27:10,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:27:10,509 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:27:10,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:27:10,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:27:10,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:27:10,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:27:10,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:27:10,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:10,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:27:10,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:27:10,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 14:27:10,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:27:10,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:27:10,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:27:10,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:27:10,713 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:27:10,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2022-04-27 14:27:10,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e656a6/601e4534a9da40c189e56ed3deccacb0/FLAGf13396813 [2022-04-27 14:27:11,095 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:27:11,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c [2022-04-27 14:27:11,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e656a6/601e4534a9da40c189e56ed3deccacb0/FLAGf13396813 [2022-04-27 14:27:11,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401e656a6/601e4534a9da40c189e56ed3deccacb0 [2022-04-27 14:27:11,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:27:11,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:27:11,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:11,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:27:11,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:27:11,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7528bfda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11, skipping insertion in model container [2022-04-27 14:27:11,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:27:11,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:27:11,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c[537,550] [2022-04-27 14:27:11,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:11,698 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:27:11,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound10.c[537,550] [2022-04-27 14:27:11,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:27:11,720 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:27:11,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11 WrapperNode [2022-04-27 14:27:11,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:27:11,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:27:11,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:27:11,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:27:11,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:27:11,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:27:11,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:27:11,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:27:11,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (1/1) ... [2022-04-27 14:27:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:27:11,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:11,774 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-27 14:27:11,787 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-27 14:27:11,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:27:11,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:27:11,799 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:27:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:27:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:27:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:27:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:27:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:27:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:27:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:27:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:27:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:27:11,849 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:27:11,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:27:11,975 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:27:11,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:27:11,980 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:27:11,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:11 BoogieIcfgContainer [2022-04-27 14:27:11,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:27:11,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:27:11,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:27:11,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:27:11,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:27:11" (1/3) ... [2022-04-27 14:27:11,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b408c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:11, skipping insertion in model container [2022-04-27 14:27:11,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:27:11" (2/3) ... [2022-04-27 14:27:11,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b408c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:27:11, skipping insertion in model container [2022-04-27 14:27:11,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:27:11" (3/3) ... [2022-04-27 14:27:11,995 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound10.c [2022-04-27 14:27:12,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:27:12,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:27:12,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:27:12,049 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@65babeed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c61322c [2022-04-27 14:27:12,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:27:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:12,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:12,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:12,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-27 14:27:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:12,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888514612] [2022-04-27 14:27:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:27:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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); {35#true} is VALID [2022-04-27 14:27:12,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:12,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:12,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:27:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:27:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:27:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:12,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:27:12,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(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); {35#true} is VALID [2022-04-27 14:27:12,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-27 14:27:12,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-27 14:27:12,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-27 14:27:12,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-27 14:27:12,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:12,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,224 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-27 14:27:12,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-27 14:27:12,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:12,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-27 14:27:12,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-27 14:27:12,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-27 14:27:12,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-27 14:27:12,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-27 14:27:12,226 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-27 14:27:12,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-27 14:27:12,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-27 14:27:12,227 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-27 14:27:12,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-27 14:27:12,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-27 14:27:12,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-27 14:27:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888514612] [2022-04-27 14:27:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888514612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:12,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:12,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:27:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194770610] [2022-04-27 14:27:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:12,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:12,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:12,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:12,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:12,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:27:12,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:27:12,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:12,272 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:12,353 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-27 14:27:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:27:12,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:27:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-27 14:27:12,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-27 14:27:12,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:12,470 INFO L225 Difference]: With dead ends: 57 [2022-04-27 14:27:12,470 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 14:27:12,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:27:12,477 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:12,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 14:27:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 14:27:12,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:12,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:12,508 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:12,508 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:12,511 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:12,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:12,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:12,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:12,512 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 14:27:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:12,514 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 14:27:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:12,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:12,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:12,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:12,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 14:27:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 14:27:12,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-27 14:27:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:12,517 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 14:27:12,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:27:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 14:27:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:27:12,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:12,518 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:12,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:27:12,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-27 14:27:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:12,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255701981] [2022-04-27 14:27:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:12,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:12,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805030822] [2022-04-27 14:27:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:12,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:12,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:12,541 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-27 14:27:12,544 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-27 14:27:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 14:27:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:12,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:12,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2022-04-27 14:27:12,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#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); {224#true} is VALID [2022-04-27 14:27:12,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:12,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224#true} {224#true} #71#return; {224#true} is VALID [2022-04-27 14:27:12,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {224#true} call #t~ret6 := main(); {224#true} is VALID [2022-04-27 14:27:12,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#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; {224#true} is VALID [2022-04-27 14:27:12,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:12,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:12,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:12,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:12,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {224#true} {224#true} #61#return; {224#true} is VALID [2022-04-27 14:27:12,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {224#true} is VALID [2022-04-27 14:27:12,792 INFO L272 TraceCheckUtils]: 12: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:12,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:12,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:12,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:12,794 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {224#true} {224#true} #63#return; {224#true} is VALID [2022-04-27 14:27:12,794 INFO L272 TraceCheckUtils]: 17: Hoare triple {224#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {224#true} is VALID [2022-04-27 14:27:12,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {224#true} ~cond := #in~cond; {224#true} is VALID [2022-04-27 14:27:12,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#true} assume !(0 == ~cond); {224#true} is VALID [2022-04-27 14:27:12,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#true} assume true; {224#true} is VALID [2022-04-27 14:27:12,794 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {224#true} {224#true} #65#return; {224#true} is VALID [2022-04-27 14:27:12,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {224#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:12,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {295#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:12,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {295#(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)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:12,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:12,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2022-04-27 14:27:12,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-27 14:27:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:12,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:12,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255701981] [2022-04-27 14:27:12,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:12,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805030822] [2022-04-27 14:27:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805030822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:12,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:12,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:27:12,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859699132] [2022-04-27 14:27:12,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:27:12,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:12,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:12,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:27:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:12,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:27:12,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:27:12,825 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:12,961 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:27:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:27:12,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 14:27:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-27 14:27:12,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-27 14:27:13,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:13,003 INFO L225 Difference]: With dead ends: 39 [2022-04-27 14:27:13,003 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 14:27:13,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:27:13,005 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:13,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 14:27:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-27 14:27:13,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:13,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,015 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,016 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:13,020 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:13,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:13,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:13,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:27:13,026 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-27 14:27:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:13,032 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 14:27:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 14:27:13,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:13,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:13,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:13,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-27 14:27:13,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-27 14:27:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:13,039 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-27 14:27:13,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 14:27:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-27 14:27:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:27:13,041 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:13,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:13,059 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-27 14:27:13,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-27 14:27:13,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-27 14:27:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362011393] [2022-04-27 14:27:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:13,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:13,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712971303] [2022-04-27 14:27:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:13,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:13,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:13,281 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-27 14:27:13,295 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-27 14:27:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:13,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:27:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:13,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:13,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} call ULTIMATE.init(); {491#true} is VALID [2022-04-27 14:27:13,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#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); {491#true} is VALID [2022-04-27 14:27:13,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:13,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} #71#return; {491#true} is VALID [2022-04-27 14:27:13,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} call #t~ret6 := main(); {491#true} is VALID [2022-04-27 14:27:13,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#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; {491#true} is VALID [2022-04-27 14:27:13,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:13,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:13,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:13,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:13,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {491#true} {491#true} #61#return; {491#true} is VALID [2022-04-27 14:27:13,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {491#true} is VALID [2022-04-27 14:27:13,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:13,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:13,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:13,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:13,497 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {491#true} {491#true} #63#return; {491#true} is VALID [2022-04-27 14:27:13,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {491#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:13,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#true} ~cond := #in~cond; {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:13,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:13,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {554#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:13,499 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {554#(not (= |assume_abort_if_not_#in~cond| 0))} {491#true} #65#return; {561#(<= 1 main_~b~0)} is VALID [2022-04-27 14:27:13,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {561#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:13,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(<= 1 main_~y~0)} assume !false; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:13,500 INFO L272 TraceCheckUtils]: 24: Hoare triple {565#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {491#true} is VALID [2022-04-27 14:27:13,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {491#true} ~cond := #in~cond; {491#true} is VALID [2022-04-27 14:27:13,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {491#true} assume !(0 == ~cond); {491#true} is VALID [2022-04-27 14:27:13,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {491#true} assume true; {491#true} is VALID [2022-04-27 14:27:13,501 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {491#true} {565#(<= 1 main_~y~0)} #67#return; {565#(<= 1 main_~y~0)} is VALID [2022-04-27 14:27:13,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {565#(<= 1 main_~y~0)} assume !(0 != ~y~0); {492#false} is VALID [2022-04-27 14:27:13,502 INFO L272 TraceCheckUtils]: 30: Hoare triple {492#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {492#false} is VALID [2022-04-27 14:27:13,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#false} ~cond := #in~cond; {492#false} is VALID [2022-04-27 14:27:13,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#false} assume 0 == ~cond; {492#false} is VALID [2022-04-27 14:27:13,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#false} assume !false; {492#false} is VALID [2022-04-27 14:27:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:27:13,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:27:13,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:13,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362011393] [2022-04-27 14:27:13,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:13,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712971303] [2022-04-27 14:27:13,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712971303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:27:13,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:27:13,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:27:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740747225] [2022-04-27 14:27:13,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:27:13,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:13,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:13,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:13,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:27:13,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:13,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:27:13,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:27:13,527 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:13,668 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 14:27:13,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:27:13,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 14:27:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-27 14:27:13,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-27 14:27:13,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:13,706 INFO L225 Difference]: With dead ends: 43 [2022-04-27 14:27:13,706 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 14:27:13,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-27 14:27:13,709 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:13,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:27:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 14:27:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-27 14:27:13,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:13,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,721 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,721 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:13,723 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:13,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:13,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:13,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-27 14:27:13,725 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-27 14:27:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:13,729 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 14:27:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 14:27:13,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:13,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:13,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:13,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:27:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 14:27:13,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-27 14:27:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:13,734 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 14:27:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 14:27:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 14:27:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:27:13,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:13,735 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:27:13,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 14:27:13,947 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-27 14:27:13,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-27 14:27:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:13,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263916842] [2022-04-27 14:27:13,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:13,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:13,965 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:13,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49662852] [2022-04-27 14:27:13,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:13,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:13,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:13,971 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-27 14:27:13,972 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-27 14:27:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:14,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:27:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:14,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:15,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:27:15,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-27 14:27:15,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:15,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:27:15,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#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; {783#true} is VALID [2022-04-27 14:27:15,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:15,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:27:15,062 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:15,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:15,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:15,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:15,063 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:27:15,063 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:27:15,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:27:15,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:27:15,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:27:15,063 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:27:15,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:15,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:15,072 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(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)); {783#true} is VALID [2022-04-27 14:27:15,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:15,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {864#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:15,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:27:15,074 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:27:15,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {854#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {878#(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-27 14:27:15,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {878#(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; {882#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:27:15,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {882#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~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); {886#(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-27 14:27:15,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {886#(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; {886#(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-27 14:27:17,083 WARN L272 TraceCheckUtils]: 33: Hoare triple {886#(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)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 14:27:17,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:17,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:27:17,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:27:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:17,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:28:17,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-27 14:28:17,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {897#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {784#false} is VALID [2022-04-27 14:28:17,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {893#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {897#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:17,601 INFO L272 TraceCheckUtils]: 33: Hoare triple {913#(= (+ 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)); {893#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:17,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:17,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {920#(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); {913#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:28:17,608 INFO L290 TraceCheckUtils]: 30: Hoare triple {924#(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; {920#(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-27 14:28:17,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {924#(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); {924#(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-27 14:28:17,780 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} {783#true} #67#return; {924#(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-27 14:28:17,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {868#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:17,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {868#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:17,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {783#true} ~cond := #in~cond; {940#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:28:17,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {783#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {783#true} assume !false; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {783#true} {783#true} #65#return; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L272 TraceCheckUtils]: 17: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:17,782 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {783#true} {783#true} #63#return; {783#true} is VALID [2022-04-27 14:28:17,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:17,783 INFO L272 TraceCheckUtils]: 12: Hoare triple {783#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {783#true} is VALID [2022-04-27 14:28:17,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {783#true} {783#true} #61#return; {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume !(0 == ~cond); {783#true} is VALID [2022-04-27 14:28:17,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} ~cond := #in~cond; {783#true} is VALID [2022-04-27 14:28:17,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {783#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {783#true} is VALID [2022-04-27 14:28:17,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#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; {783#true} is VALID [2022-04-27 14:28:17,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret6 := main(); {783#true} is VALID [2022-04-27 14:28:17,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #71#return; {783#true} is VALID [2022-04-27 14:28:17,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-27 14:28:17,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#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); {783#true} is VALID [2022-04-27 14:28:17,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {783#true} is VALID [2022-04-27 14:28:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:28:17,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:28:17,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263916842] [2022-04-27 14:28:17,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:28:17,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49662852] [2022-04-27 14:28:17,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49662852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:28:17,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:28:17,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-27 14:28:17,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813705777] [2022-04-27 14:28:17,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:28:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:28:17,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:28:17,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:28:19,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:19,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 14:28:19,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:28:19,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 14:28:19,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:28:19,559 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:28:29,424 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-27 14:28:32,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:28:34,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:28:36,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:28:37,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:28:43,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:28:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:50,329 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-27 14:28:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:28:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2022-04-27 14:28:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:28:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:28:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:28:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:28:50,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-27 14:28:50,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-27 14:28:52,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:28:52,952 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:28:52,953 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 14:28:52,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:28:52,953 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-27 14:28:52,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2022-04-27 14:28:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 14:28:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-27 14:28:52,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:28:52,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:28:52,973 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:28:52,974 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:28:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:52,975 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:28:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:28:52,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:52,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:52,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 14:28:52,976 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 14:28:52,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:28:52,977 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:28:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-04-27 14:28:52,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:28:52,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:28:52,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:28:52,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:28:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 states have internal predecessors, (37), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:28:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-04-27 14:28:52,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 37 [2022-04-27 14:28:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:28:52,979 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-04-27 14:28:52,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:28:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-27 14:28:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 14:28:52,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:28:52,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:28:52,997 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-27 14:28:53,180 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-27 14:28:53,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:28:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:28:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-27 14:28:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:28:53,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349963437] [2022-04-27 14:28:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:28:53,197 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:28:53,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703782474] [2022-04-27 14:28:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:28:53,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:28:53,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:28:53,202 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-27 14:28:53,203 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-27 14:28:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:53,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:28:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:28:53,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:28:54,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1266#true} call ULTIMATE.init(); {1266#true} is VALID [2022-04-27 14:28:54,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1266#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); {1266#true} is VALID [2022-04-27 14:28:54,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:28:54,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} #71#return; {1266#true} is VALID [2022-04-27 14:28:54,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {1266#true} call #t~ret6 := main(); {1266#true} is VALID [2022-04-27 14:28:54,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#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; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {1266#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#true} ~cond := #in~cond; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#true} assume !(0 == ~cond); {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1266#true} {1266#true} #61#return; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {1266#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#true} ~cond := #in~cond; {1266#true} is VALID [2022-04-27 14:28:54,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#true} assume !(0 == ~cond); {1266#true} is VALID [2022-04-27 14:28:54,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:28:54,611 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1266#true} {1266#true} #63#return; {1266#true} is VALID [2022-04-27 14:28:54,611 INFO L272 TraceCheckUtils]: 17: Hoare triple {1266#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:28:54,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#true} ~cond := #in~cond; {1325#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:28:54,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:54,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:28:54,615 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1329#(not (= |assume_abort_if_not_#in~cond| 0))} {1266#true} #65#return; {1336#(<= 1 main_~b~0)} is VALID [2022-04-27 14:28:54,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {1336#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1340#(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-27 14:28:54,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {1340#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1340#(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-27 14:28:54,616 INFO L272 TraceCheckUtils]: 24: Hoare triple {1340#(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)); {1266#true} is VALID [2022-04-27 14:28:54,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1266#true} ~cond := #in~cond; {1350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:54,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {1350#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:54,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:28:54,617 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} {1340#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1340#(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-27 14:28:54,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {1340#(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); {1340#(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-27 14:28:54,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {1340#(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)); {1367#(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-27 14:28:54,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {1367#(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); {1371#(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-27 14:28:54,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {1371#(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; {1371#(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-27 14:28:54,621 INFO L272 TraceCheckUtils]: 33: Hoare triple {1371#(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)); {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:28:54,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:28:54,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {1382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1267#false} is VALID [2022-04-27 14:28:54,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2022-04-27 14:28:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:28:54,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:30,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {1267#false} assume !false; {1267#false} is VALID [2022-04-27 14:29:30,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {1382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1267#false} is VALID [2022-04-27 14:29:30,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:30,077 INFO L272 TraceCheckUtils]: 33: Hoare triple {1398#(= (+ 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)); {1378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:30,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {1398#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1398#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:30,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {1405#(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); {1398#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:30,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {1409#(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)); {1405#(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-27 14:29:30,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {1409#(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); {1409#(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-27 14:29:30,085 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} {1416#(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)))} #67#return; {1409#(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-27 14:29:30,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:30,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {1426#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1354#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:30,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {1266#true} ~cond := #in~cond; {1426#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:29:30,086 INFO L272 TraceCheckUtils]: 24: Hoare triple {1416#(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)); {1266#true} is VALID [2022-04-27 14:29:30,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {1416#(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; {1416#(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-27 14:29:30,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {1436#(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; {1416#(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-27 14:29:30,088 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1329#(not (= |assume_abort_if_not_#in~cond| 0))} {1266#true} #65#return; {1436#(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-27 14:29:30,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:30,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {1449#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1329#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#true} ~cond := #in~cond; {1449#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:29:30,089 INFO L272 TraceCheckUtils]: 17: Hoare triple {1266#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1266#true} {1266#true} #63#return; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {1266#true} assume !(0 == ~cond); {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {1266#true} ~cond := #in~cond; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {1266#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1266#true} {1266#true} #61#return; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#true} assume !(0 == ~cond); {1266#true} is VALID [2022-04-27 14:29:30,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {1266#true} ~cond := #in~cond; {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L272 TraceCheckUtils]: 6: Hoare triple {1266#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {1266#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; {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1266#true} call #t~ret6 := main(); {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1266#true} {1266#true} #71#return; {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1266#true} assume true; {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1266#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); {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {1266#true} call ULTIMATE.init(); {1266#true} is VALID [2022-04-27 14:29:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:29:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:30,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349963437] [2022-04-27 14:29:30,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:30,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703782474] [2022-04-27 14:29:30,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703782474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:30,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:30,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-27 14:29:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747394074] [2022-04-27 14:29:30,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:29:30,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:30,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:29:30,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:30,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 14:29:30,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 14:29:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-27 14:29:30,129 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:29:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:32,265 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-04-27 14:29:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 14:29:32,265 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 37 [2022-04-27 14:29:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:29:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:29:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:29:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 67 transitions. [2022-04-27 14:29:32,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 67 transitions. [2022-04-27 14:29:32,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:32,335 INFO L225 Difference]: With dead ends: 78 [2022-04-27 14:29:32,335 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 14:29:32,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-27 14:29:32,336 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:32,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 130 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-27 14:29:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 14:29:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 14:29:32,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:29:32,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:29:32,356 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:29:32,357 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:29:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:32,358 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-27 14:29:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-27 14:29:32,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:32,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:32,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 71 states. [2022-04-27 14:29:32,359 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 71 states. [2022-04-27 14:29:32,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:32,361 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-27 14:29:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-27 14:29:32,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:29:32,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:29:32,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:29:32,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:29:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.183673469387755) internal successors, (58), 53 states have internal predecessors, (58), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:29:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-27 14:29:32,363 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 37 [2022-04-27 14:29:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:29:32,363 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-27 14:29:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 16 states have internal predecessors, (32), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:29:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-27 14:29:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 14:29:32,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:29:32,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-04-27 14:29:32,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 14:29:32,571 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-27 14:29:32,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:29:32,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:29:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-27 14:29:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:29:32,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701641565] [2022-04-27 14:29:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:29:32,590 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:29:32,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981364402] [2022-04-27 14:29:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:29:32,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:29:32,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:29:32,606 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-27 14:29:32,623 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-27 14:29:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:32,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:29:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:29:32,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:29:42,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1873#true} call ULTIMATE.init(); {1873#true} is VALID [2022-04-27 14:29:42,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1873#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); {1873#true} is VALID [2022-04-27 14:29:42,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:42,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1873#true} {1873#true} #71#return; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1873#true} call #t~ret6 := main(); {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1873#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; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {1873#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1873#true} {1873#true} #61#return; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {1873#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L272 TraceCheckUtils]: 12: Hoare triple {1873#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:42,356 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1873#true} {1873#true} #63#return; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L272 TraceCheckUtils]: 17: Hoare triple {1873#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1873#true} {1873#true} #65#return; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {1873#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {1873#true} assume !false; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L272 TraceCheckUtils]: 24: Hoare triple {1873#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1873#true} {1873#true} #67#return; {1873#true} is VALID [2022-04-27 14:29:42,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {1873#true} assume !!(0 != ~y~0); {1873#true} is VALID [2022-04-27 14:29:42,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {1873#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; {1873#true} is VALID [2022-04-27 14:29:42,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {1873#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); {1873#true} is VALID [2022-04-27 14:29:42,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {1873#true} assume !false; {1873#true} is VALID [2022-04-27 14:29:42,358 INFO L272 TraceCheckUtils]: 33: Hoare triple {1873#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:42,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {1873#true} ~cond := #in~cond; {1980#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:42,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {1980#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:42,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:44,361 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} {1873#true} #67#return; {1991#(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-27 14:29:44,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {1991#(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); {1995#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:44,362 INFO L272 TraceCheckUtils]: 39: Hoare triple {1995#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1999#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:44,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {1999#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2003#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:44,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {2003#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1874#false} is VALID [2022-04-27 14:29:44,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {1874#false} assume !false; {1874#false} is VALID [2022-04-27 14:29:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:29:44,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:29:51,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {1874#false} assume !false; {1874#false} is VALID [2022-04-27 14:29:51,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {2003#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1874#false} is VALID [2022-04-27 14:29:51,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {1999#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2003#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:29:51,621 INFO L272 TraceCheckUtils]: 39: Hoare triple {1995#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1999#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:29:51,621 INFO L290 TraceCheckUtils]: 38: Hoare triple {2022#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1995#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:29:51,622 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} {1873#true} #67#return; {2022#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 14:29:51,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2035#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {1873#true} ~cond := #in~cond; {2035#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:29:51,623 INFO L272 TraceCheckUtils]: 33: Hoare triple {1873#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 32: Hoare triple {1873#true} assume !false; {1873#true} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {1873#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); {1873#true} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {1873#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; {1873#true} is VALID [2022-04-27 14:29:51,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {1873#true} assume !!(0 != ~y~0); {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1873#true} {1873#true} #67#return; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L272 TraceCheckUtils]: 24: Hoare triple {1873#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {1873#true} assume !false; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {1873#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1873#true} {1873#true} #65#return; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L272 TraceCheckUtils]: 17: Hoare triple {1873#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1873#true} {1873#true} #63#return; {1873#true} is VALID [2022-04-27 14:29:51,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L272 TraceCheckUtils]: 12: Hoare triple {1873#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {1873#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1873#true} {1873#true} #61#return; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#true} assume !(0 == ~cond); {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#true} ~cond := #in~cond; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {1873#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {1873#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; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1873#true} call #t~ret6 := main(); {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1873#true} {1873#true} #71#return; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1873#true} assume true; {1873#true} is VALID [2022-04-27 14:29:51,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1873#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); {1873#true} is VALID [2022-04-27 14:29:51,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {1873#true} call ULTIMATE.init(); {1873#true} is VALID [2022-04-27 14:29:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:29:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:29:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701641565] [2022-04-27 14:29:51,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:29:51,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981364402] [2022-04-27 14:29:51,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981364402] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:29:51,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:29:51,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 14:29:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706344796] [2022-04-27 14:29:51,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:29:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:29:51,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:29:51,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:53,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:53,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:29:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:29:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:29:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:29:53,653 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:55,705 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-27 14:29:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:29:55,959 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-27 14:29:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 14:29:55,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-27 14:29:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:29:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-27 14:29:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:29:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2022-04-27 14:29:55,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 40 transitions. [2022-04-27 14:29:59,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 14:29:59,992 INFO L225 Difference]: With dead ends: 77 [2022-04-27 14:29:59,993 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 14:29:59,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 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-27 14:29:59,993 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:29:59,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 139 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 14:29:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 14:30:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 14:30:00,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:00,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:00,014 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:00,014 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:00,016 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 14:30:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-27 14:30:00,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:00,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:00,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 70 states. [2022-04-27 14:30:00,017 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 70 states. [2022-04-27 14:30:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:00,018 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-27 14:30:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-27 14:30:00,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:00,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:00,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:00,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-04-27 14:30:00,020 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 43 [2022-04-27 14:30:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:00,020 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-04-27 14:30:00,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 14:30:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-04-27 14:30:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:30:00,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:00,021 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:00,051 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-27 14:30:00,236 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-27 14:30:00,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 1 times [2022-04-27 14:30:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:00,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145913556] [2022-04-27 14:30:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:00,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:00,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [580061778] [2022-04-27 14:30:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:00,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:00,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:00,251 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-27 14:30:00,252 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-27 14:30:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:00,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 14:30:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:00,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:01,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {2491#true} call ULTIMATE.init(); {2491#true} is VALID [2022-04-27 14:30:01,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {2491#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); {2491#true} is VALID [2022-04-27 14:30:01,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2491#true} {2491#true} #71#return; {2491#true} is VALID [2022-04-27 14:30:01,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#true} call #t~ret6 := main(); {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#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; {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {2491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2491#true} {2491#true} #61#return; {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L272 TraceCheckUtils]: 12: Hoare triple {2491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#true} ~cond := #in~cond; {2535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:30:01,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:01,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:01,397 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2539#(not (= |assume_abort_if_not_#in~cond| 0))} {2491#true} #63#return; {2546#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:30:01,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {2546#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:01,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:01,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2491#true} {2546#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {2546#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:30:01,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2565#(<= main_~y~0 10)} is VALID [2022-04-27 14:30:01,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {2565#(<= main_~y~0 10)} assume !false; {2565#(<= main_~y~0 10)} is VALID [2022-04-27 14:30:01,398 INFO L272 TraceCheckUtils]: 24: Hoare triple {2565#(<= main_~y~0 10)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:01,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:01,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,399 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2491#true} {2565#(<= main_~y~0 10)} #67#return; {2565#(<= main_~y~0 10)} is VALID [2022-04-27 14:30:01,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {2565#(<= main_~y~0 10)} assume !!(0 != ~y~0); {2587#(and (not (= main_~y~0 0)) (<= main_~y~0 10))} is VALID [2022-04-27 14:30:01,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {2587#(and (not (= main_~y~0 0)) (<= main_~y~0 10))} 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; {2591#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 9) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:01,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {2591#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 9) (<= 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); {2595#(exists ((aux_mod_v_main_~y~0_26_28 Int) (aux_div_v_main_~y~0_26_28 Int)) (and (<= 0 (+ (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28)) (<= 1 aux_mod_v_main_~y~0_26_28) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28) 2)) (< aux_mod_v_main_~y~0_26_28 2) (<= (+ (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28) 10)))} is VALID [2022-04-27 14:30:01,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {2595#(exists ((aux_mod_v_main_~y~0_26_28 Int) (aux_div_v_main_~y~0_26_28 Int)) (and (<= 0 (+ (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28)) (<= 1 aux_mod_v_main_~y~0_26_28) (<= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28) 2)) (< aux_mod_v_main_~y~0_26_28 2) (<= (+ (* aux_div_v_main_~y~0_26_28 2) aux_mod_v_main_~y~0_26_28) 10)))} assume !false; {2599#(<= main_~y~0 4)} is VALID [2022-04-27 14:30:01,404 INFO L272 TraceCheckUtils]: 33: Hoare triple {2599#(<= main_~y~0 4)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:01,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:01,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,405 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2491#true} {2599#(<= main_~y~0 4)} #67#return; {2599#(<= main_~y~0 4)} is VALID [2022-04-27 14:30:01,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {2599#(<= main_~y~0 4)} assume !!(0 != ~y~0); {2618#(and (not (= main_~y~0 0)) (<= main_~y~0 4))} is VALID [2022-04-27 14:30:01,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {2618#(and (not (= main_~y~0 0)) (<= main_~y~0 4))} 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; {2622#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 3) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:30:01,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {2622#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= main_~y~0 3) (<= 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); {2626#(exists ((aux_div_v_main_~y~0_28_28 Int) (aux_mod_v_main_~y~0_28_28 Int)) (and (<= 1 aux_mod_v_main_~y~0_28_28) (= (div (+ (- 1) (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28) 2) main_~y~0) (< aux_mod_v_main_~y~0_28_28 2) (<= (+ (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28) 4) (<= 0 (+ (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28))))} is VALID [2022-04-27 14:30:01,409 INFO L290 TraceCheckUtils]: 41: Hoare triple {2626#(exists ((aux_div_v_main_~y~0_28_28 Int) (aux_mod_v_main_~y~0_28_28 Int)) (and (<= 1 aux_mod_v_main_~y~0_28_28) (= (div (+ (- 1) (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28) 2) main_~y~0) (< aux_mod_v_main_~y~0_28_28 2) (<= (+ (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28) 4) (<= 0 (+ (* aux_div_v_main_~y~0_28_28 2) aux_mod_v_main_~y~0_28_28))))} assume !false; {2630#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-27 14:30:01,409 INFO L272 TraceCheckUtils]: 42: Hoare triple {2630#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:01,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:01,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:01,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:01,410 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2491#true} {2630#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} #67#return; {2630#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-27 14:30:01,410 INFO L290 TraceCheckUtils]: 47: Hoare triple {2630#(and (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} assume !!(0 != ~y~0); {2649#(and (not (= main_~y~0 0)) (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {2649#(and (not (= main_~y~0 0)) (< 0 (+ main_~y~0 1)) (<= (* main_~y~0 2) 3))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {2492#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 50: Hoare triple {2492#false} assume !false; {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L272 TraceCheckUtils]: 51: Hoare triple {2492#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {2492#false} ~cond := #in~cond; {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {2492#false} assume 0 == ~cond; {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {2492#false} assume !false; {2492#false} is VALID [2022-04-27 14:30:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:30:01,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:30:04,193 INFO L290 TraceCheckUtils]: 54: Hoare triple {2492#false} assume !false; {2492#false} is VALID [2022-04-27 14:30:04,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {2492#false} assume 0 == ~cond; {2492#false} is VALID [2022-04-27 14:30:04,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {2492#false} ~cond := #in~cond; {2492#false} is VALID [2022-04-27 14:30:04,193 INFO L272 TraceCheckUtils]: 51: Hoare triple {2492#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2492#false} is VALID [2022-04-27 14:30:04,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {2492#false} assume !false; {2492#false} is VALID [2022-04-27 14:30:04,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {2492#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2492#false} is VALID [2022-04-27 14:30:04,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {2689#(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)); {2492#false} is VALID [2022-04-27 14:30:04,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !!(0 != ~y~0); {2689#(and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:30:04,195 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2491#true} {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} #67#return; {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-27 14:30:04,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:04,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:04,195 INFO L272 TraceCheckUtils]: 42: Hoare triple {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !false; {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-27 14:30:04,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {2715#(and (or (= (div main_~y~0 2) 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)))) (or (not (< main_~y~0 0)) (= (+ (div main_~y~0 2) 1) 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); {2693#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-27 14:30:04,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) 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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2715#(and (or (= (div main_~y~0 2) 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)))) (or (not (< main_~y~0 0)) (= (+ (div main_~y~0 2) 1) 0)))} is VALID [2022-04-27 14:30:04,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} assume !!(0 != ~y~0); {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-27 14:30:04,199 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2491#true} {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} #67#return; {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-27 14:30:04,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:04,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:04,199 INFO L272 TraceCheckUtils]: 33: Hoare triple {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} assume !false; {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-27 14:30:04,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {2744#(<= (div (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 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); {2719#(or (= (div (+ (- 1) main_~y~0) 2) 0) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= (mod (div (+ (- 1) main_~y~0) 2) 2) 1))} is VALID [2022-04-27 14:30:04,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2744#(<= (div (* (- 1) (div (* (- 1) (div main_~y~0 2)) (- 2))) (- 2)) 1)} is VALID [2022-04-27 14:30:04,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} assume !!(0 != ~y~0); {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:30:04,202 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2491#true} {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} #67#return; {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:30:04,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:04,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:04,203 INFO L272 TraceCheckUtils]: 24: Hoare triple {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} assume !false; {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:30:04,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {2773#(<= (div (+ (- 1) (div (+ (- 1) (* (- 1) (div (* (- 1) main_~b~0) (- 2)))) 2)) (- 2)) 2)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2748#(or (<= (div (* (- 1) (div (* (- 1) (div (+ (- 1) main_~y~0) 2)) (- 2))) (- 2)) 1) (< (mod main_~y~0 2) 1))} is VALID [2022-04-27 14:30:04,205 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2491#true} {2773#(<= (div (+ (- 1) (div (+ (- 1) (* (- 1) (div (* (- 1) main_~b~0) (- 2)))) 2)) (- 2)) 2)} #65#return; {2773#(<= (div (+ (- 1) (div (+ (- 1) (* (- 1) (div (* (- 1) main_~b~0) (- 2)))) 2)) (- 2)) 2)} is VALID [2022-04-27 14:30:04,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:04,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:04,205 INFO L272 TraceCheckUtils]: 17: Hoare triple {2773#(<= (div (+ (- 1) (div (+ (- 1) (* (- 1) (div (* (- 1) main_~b~0) (- 2)))) 2)) (- 2)) 2)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,206 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2539#(not (= |assume_abort_if_not_#in~cond| 0))} {2491#true} #63#return; {2773#(<= (div (+ (- 1) (div (+ (- 1) (* (- 1) (div (* (- 1) main_~b~0) (- 2)))) 2)) (- 2)) 2)} is VALID [2022-04-27 14:30:04,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {2539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {2801#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#true} ~cond := #in~cond; {2801#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:30:04,207 INFO L272 TraceCheckUtils]: 12: Hoare triple {2491#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {2491#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2491#true} {2491#true} #61#return; {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#true} assume !(0 == ~cond); {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#true} ~cond := #in~cond; {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {2491#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {2491#true} is VALID [2022-04-27 14:30:04,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#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; {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#true} call #t~ret6 := main(); {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2491#true} {2491#true} #71#return; {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#true} assume true; {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2491#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); {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {2491#true} call ULTIMATE.init(); {2491#true} is VALID [2022-04-27 14:30:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:30:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:30:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145913556] [2022-04-27 14:30:04,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:30:04,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580061778] [2022-04-27 14:30:04,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580061778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:30:04,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:30:04,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2022-04-27 14:30:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738265878] [2022-04-27 14:30:04,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:30:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-27 14:30:04,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:30:04,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:30:04,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:04,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-27 14:30:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:30:04,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-27 14:30:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-04-27 14:30:04,266 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:30:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:05,801 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-04-27 14:30:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 14:30:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 55 [2022-04-27 14:30:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:30:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:30:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2022-04-27 14:30:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:30:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 71 transitions. [2022-04-27 14:30:05,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 71 transitions. [2022-04-27 14:30:05,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:30:05,862 INFO L225 Difference]: With dead ends: 97 [2022-04-27 14:30:05,862 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 14:30:05,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 14:30:05,863 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 14:30:05,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 267 Invalid, 0 Unknown, 21 Unchecked, 0.5s Time] [2022-04-27 14:30:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 14:30:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 14:30:05,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:30:05,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:05,904 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:05,904 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:05,906 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 14:30:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 14:30:05,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:05,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:05,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 70 states. [2022-04-27 14:30:05,907 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand 70 states. [2022-04-27 14:30:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:30:05,909 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 14:30:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 14:30:05,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:30:05,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:30:05,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:30:05,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:30:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 14:30:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-04-27 14:30:05,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 55 [2022-04-27 14:30:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:30:05,911 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-04-27 14:30:05,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 10 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2022-04-27 14:30:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 14:30:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:30:05,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:30:05,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:30:05,933 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-27 14:30:06,127 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-27 14:30:06,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:30:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:30:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1814345074, now seen corresponding path program 2 times [2022-04-27 14:30:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:30:06,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34166689] [2022-04-27 14:30:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:30:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:30:06,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:30:06,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896621823] [2022-04-27 14:30:06,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:30:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:30:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:30:06,140 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-27 14:30:06,141 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-27 14:30:06,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:30:06,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:30:06,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 14:30:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:30:06,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:30:17,059 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:31:51,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {3242#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); {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #71#return; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret6 := main(); {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {3242#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; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {3242#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#true} ~cond := #in~cond; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {3242#true} assume !(0 == ~cond); {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {3242#true} assume true; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3242#true} {3242#true} #61#return; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {3242#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3242#true} is VALID [2022-04-27 14:31:51,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {3242#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {3242#true} ~cond := #in~cond; {3286#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:31:51,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {3286#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3290#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:31:51,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3290#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3290#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:31:51,900 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3290#(not (= |assume_abort_if_not_#in~cond| 0))} {3242#true} #63#return; {3297#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {3297#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {3242#true} ~cond := #in~cond; {3242#true} is VALID [2022-04-27 14:31:51,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {3242#true} assume !(0 == ~cond); {3242#true} is VALID [2022-04-27 14:31:51,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {3242#true} assume true; {3242#true} is VALID [2022-04-27 14:31:51,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3242#true} {3297#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {3297#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {3297#(and (<= 0 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:51,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} assume !false; {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:51,901 INFO L272 TraceCheckUtils]: 24: Hoare triple {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#true} ~cond := #in~cond; {3242#true} is VALID [2022-04-27 14:31:51,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {3242#true} assume !(0 == ~cond); {3242#true} is VALID [2022-04-27 14:31:51,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {3242#true} assume true; {3242#true} is VALID [2022-04-27 14:31:51,902 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3242#true} {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} #67#return; {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:51,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {3316#(and (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3338#(and (not (= main_~y~0 0)) (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 14:31:51,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {3338#(and (not (= main_~y~0 0)) (<= main_~y~0 main_~b~0) (<= 0 main_~b~0) (<= main_~b~0 10) (= 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; {3342#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= (+ main_~y~0 1) main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:31:51,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {3342#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= (+ main_~y~0 1) main_~b~0) (<= main_~b~0 10) (= main_~a~0 main_~x~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); {3346#(and (exists ((aux_mod_v_main_~y~0_36_28 Int) (aux_div_v_main_~y~0_36_28 Int)) (and (= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28) 2)) (< aux_mod_v_main_~y~0_36_28 2) (<= 0 (+ (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28)) (<= 1 aux_mod_v_main_~y~0_36_28) (<= (+ (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28) main_~b~0))) (= (* main_~a~0 2) main_~x~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {3346#(and (exists ((aux_mod_v_main_~y~0_36_28 Int) (aux_div_v_main_~y~0_36_28 Int)) (and (= main_~y~0 (div (+ (- 1) (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28) 2)) (< aux_mod_v_main_~y~0_36_28 2) (<= 0 (+ (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28)) (<= 1 aux_mod_v_main_~y~0_36_28) (<= (+ (* aux_div_v_main_~y~0_36_28 2) aux_mod_v_main_~y~0_36_28) main_~b~0))) (= (* main_~a~0 2) main_~x~0) (<= main_~b~0 10))} assume !false; {3350#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} is VALID [2022-04-27 14:31:51,924 INFO L272 TraceCheckUtils]: 33: Hoare triple {3350#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {3242#true} ~cond := #in~cond; {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:51,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:51,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:51,926 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} {3350#(and (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} #67#return; {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} is VALID [2022-04-27 14:31:51,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} assume !!(0 != ~y~0); {3372#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} is VALID [2022-04-27 14:31:51,927 INFO L290 TraceCheckUtils]: 39: Hoare triple {3372#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3376#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 1) main_~b~0))} is VALID [2022-04-27 14:31:51,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {3376#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (< 0 (+ main_~y~0 1)) (<= main_~b~0 10) (<= (+ (* main_~y~0 2) 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); {3380#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_div_v_main_~y~0_37_22 Int) (aux_mod_v_main_~y~0_37_22 Int)) (and (<= (+ (* aux_div_v_main_~y~0_37_22 4) (* 2 aux_mod_v_main_~y~0_37_22) 1) main_~b~0) (<= 0 aux_mod_v_main_~y~0_37_22) (< 0 (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22 1)) (= (+ main_~z~0 (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22))) (* main_~b~0 main_~a~0)) (not (= (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22) 0)) (< aux_mod_v_main_~y~0_37_22 2) (not (= aux_mod_v_main_~y~0_37_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22) 2)))) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {3380#(and (= (* main_~a~0 4) main_~x~0) (exists ((aux_div_v_main_~y~0_37_22 Int) (aux_mod_v_main_~y~0_37_22 Int)) (and (<= (+ (* aux_div_v_main_~y~0_37_22 4) (* 2 aux_mod_v_main_~y~0_37_22) 1) main_~b~0) (<= 0 aux_mod_v_main_~y~0_37_22) (< 0 (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22 1)) (= (+ main_~z~0 (* (* main_~a~0 2) (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22))) (* main_~b~0 main_~a~0)) (not (= (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22) 0)) (< aux_mod_v_main_~y~0_37_22 2) (not (= aux_mod_v_main_~y~0_37_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_37_22 2) aux_mod_v_main_~y~0_37_22) 2)))) (<= main_~b~0 10))} assume !false; {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,939 INFO L272 TraceCheckUtils]: 42: Hoare triple {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3242#true} is VALID [2022-04-27 14:31:51,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {3242#true} ~cond := #in~cond; {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:51,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:51,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:31:51,941 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} #67#return; {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} assume !!(0 != ~y~0); {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {3384#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3406#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {3406#(and (= (mod (+ main_~z~0 (* main_~a~0 main_~y~0 (- 4)) (* main_~b~0 main_~a~0)) 2) 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod main_~y~0 2) 1)) (< main_~y~0 (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* main_~a~0 main_~y~0))) (< 0 main_~y~0) (<= main_~b~0 10))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3410#(and (exists ((aux_mod_aux_mod_v_main_~y~0_38_22_33 Int) (aux_div_aux_mod_v_main_~y~0_38_22_33 Int)) (and (< aux_mod_aux_mod_v_main_~y~0_38_22_33 2) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0))) (< (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) 2) (< 0 (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (not (= aux_mod_aux_mod_v_main_~y~0_38_22_33 1)) (<= 0 aux_mod_aux_mod_v_main_~y~0_38_22_33) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (< (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod (+ (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0 (- 4)) main_~z~0 (* main_~b~0 main_~a~0)) 2) 0))) (= main_~x~0 (* main_~a~0 8)) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:51,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {3410#(and (exists ((aux_mod_aux_mod_v_main_~y~0_38_22_33 Int) (aux_div_aux_mod_v_main_~y~0_38_22_33 Int)) (and (< aux_mod_aux_mod_v_main_~y~0_38_22_33 2) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0))) (< (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) 2) (< 0 (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (not (= aux_mod_aux_mod_v_main_~y~0_38_22_33 1)) (<= 0 aux_mod_aux_mod_v_main_~y~0_38_22_33) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (< (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod (+ (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0 (- 4)) main_~z~0 (* main_~b~0 main_~a~0)) 2) 0))) (= main_~x~0 (* main_~a~0 8)) (<= main_~b~0 10))} assume !false; {3410#(and (exists ((aux_mod_aux_mod_v_main_~y~0_38_22_33 Int) (aux_div_aux_mod_v_main_~y~0_38_22_33 Int)) (and (< aux_mod_aux_mod_v_main_~y~0_38_22_33 2) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0))) (< (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) 2) (< 0 (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (not (= aux_mod_aux_mod_v_main_~y~0_38_22_33 1)) (<= 0 aux_mod_aux_mod_v_main_~y~0_38_22_33) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (< (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod (+ (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0 (- 4)) main_~z~0 (* main_~b~0 main_~a~0)) 2) 0))) (= main_~x~0 (* main_~a~0 8)) (<= main_~b~0 10))} is VALID [2022-04-27 14:31:52,306 INFO L272 TraceCheckUtils]: 51: Hoare triple {3410#(and (exists ((aux_mod_aux_mod_v_main_~y~0_38_22_33 Int) (aux_div_aux_mod_v_main_~y~0_38_22_33 Int)) (and (< aux_mod_aux_mod_v_main_~y~0_38_22_33 2) (= (div (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 2) (* 2 (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0))) (< (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) 2) (< 0 (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (not (= aux_mod_aux_mod_v_main_~y~0_38_22_33 1)) (<= 0 aux_mod_aux_mod_v_main_~y~0_38_22_33) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33)) (< (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) (+ (div (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod (+ (* (+ (* main_~y~0 2) (* 2 aux_div_aux_mod_v_main_~y~0_38_22_33) aux_mod_aux_mod_v_main_~y~0_38_22_33) main_~a~0 (- 4)) main_~z~0 (* main_~b~0 main_~a~0)) 2) 0))) (= main_~x~0 (* main_~a~0 8)) (<= main_~b~0 10))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:31:52,307 INFO L290 TraceCheckUtils]: 52: Hoare triple {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:31:52,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {3421#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3243#false} is VALID [2022-04-27 14:31:52,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2022-04-27 14:31:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:31:52,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:35:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:35:39,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34166689] [2022-04-27 14:35:39,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:35:39,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896621823] [2022-04-27 14:35:39,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896621823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 14:35:39,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:35:39,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2022-04-27 14:35:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189463398] [2022-04-27 14:35:39,000 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 14:35:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 55 [2022-04-27 14:35:39,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:35:39,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:35:39,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:39,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 14:35:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:35:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 14:35:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2022-04-27 14:35:39,446 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:35:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:52,869 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-04-27 14:35:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 14:35:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 55 [2022-04-27 14:35:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:35:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:35:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-27 14:35:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:35:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-27 14:35:52,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2022-04-27 14:35:53,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:35:53,810 INFO L225 Difference]: With dead ends: 81 [2022-04-27 14:35:53,810 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 14:35:53,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2022-04-27 14:35:53,811 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:35:53,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 252 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 92 Unchecked, 6.8s Time] [2022-04-27 14:35:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 14:35:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-27 14:35:53,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:35:53,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:35:53,864 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:35:53,864 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:35:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:53,866 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-27 14:35:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-04-27 14:35:53,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:53,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:53,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 79 states. [2022-04-27 14:35:53,866 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 79 states. [2022-04-27 14:35:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:35:53,868 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-27 14:35:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-04-27 14:35:53,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:35:53,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:35:53,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:35:53,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:35:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 59 states have internal predecessors, (59), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 14:35:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2022-04-27 14:35:53,870 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 55 [2022-04-27 14:35:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:35:53,870 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2022-04-27 14:35:53,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-27 14:35:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2022-04-27 14:35:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 14:35:53,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:35:53,871 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:35:53,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 14:35:54,080 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-27 14:35:54,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:35:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:35:54,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1319005258, now seen corresponding path program 3 times [2022-04-27 14:35:54,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:35:54,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203845907] [2022-04-27 14:35:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:35:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:35:54,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:35:54,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492714502] [2022-04-27 14:35:54,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 14:35:54,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:35:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:35:54,092 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:35:54,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 14:35:54,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 14:35:54,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:35:54,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 14:35:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:35:54,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:36:08,795 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:36:13,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {3878#true} call ULTIMATE.init(); {3878#true} is VALID [2022-04-27 14:36:13,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {3878#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); {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3878#true} {3878#true} #71#return; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {3878#true} call #t~ret6 := main(); {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {3878#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; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L272 TraceCheckUtils]: 6: Hoare triple {3878#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3878#true} {3878#true} #61#return; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {3878#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L272 TraceCheckUtils]: 12: Hoare triple {3878#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:13,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3878#true} {3878#true} #63#return; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L272 TraceCheckUtils]: 17: Hoare triple {3878#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3878#true} {3878#true} #65#return; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {3878#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {3878#true} assume !false; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L272 TraceCheckUtils]: 24: Hoare triple {3878#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3878#true} {3878#true} #67#return; {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {3878#true} assume !!(0 != ~y~0); {3878#true} is VALID [2022-04-27 14:36:13,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {3878#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {3878#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); {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {3878#true} assume !false; {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L272 TraceCheckUtils]: 33: Hoare triple {3878#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:13,155 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3878#true} {3878#true} #67#return; {3878#true} is VALID [2022-04-27 14:36:13,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {3878#true} assume !!(0 != ~y~0); {3997#(not (= main_~y~0 0))} is VALID [2022-04-27 14:36:13,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {3997#(not (= 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; {4001#(< 0 (+ main_~y~0 1))} is VALID [2022-04-27 14:36:13,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {4001#(< 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); {4001#(< 0 (+ main_~y~0 1))} is VALID [2022-04-27 14:36:13,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {4001#(< 0 (+ main_~y~0 1))} assume !false; {4001#(< 0 (+ main_~y~0 1))} is VALID [2022-04-27 14:36:13,169 INFO L272 TraceCheckUtils]: 42: Hoare triple {4001#(< 0 (+ main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:13,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {3878#true} ~cond := #in~cond; {4014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:13,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {4014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:13,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:13,170 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} {4001#(< 0 (+ main_~y~0 1))} #67#return; {4025#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:36:13,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {4025#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {4025#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:36:13,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {4025#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4032#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 14:36:13,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {4032#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 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); {4036#(and (exists ((aux_div_v_main_~y~0_47_22 Int) (aux_mod_v_main_~y~0_47_22 Int)) (and (< 0 (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2) 1)) (< aux_mod_v_main_~y~0_47_22 2) (not (= aux_mod_v_main_~y~0_47_22 1)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2)) 2)) (= (+ (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 aux_mod_v_main_~y~0_47_22))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 14:36:14,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {4036#(and (exists ((aux_div_v_main_~y~0_47_22 Int) (aux_mod_v_main_~y~0_47_22 Int)) (and (< 0 (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2) 1)) (< aux_mod_v_main_~y~0_47_22 2) (not (= aux_mod_v_main_~y~0_47_22 1)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2)) 2)) (= (+ (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_47_22 (* aux_div_v_main_~y~0_47_22 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= 0 aux_mod_v_main_~y~0_47_22))) (= (mod main_~x~0 2) 0))} assume !false; {4040#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 14:36:15,348 INFO L272 TraceCheckUtils]: 51: Hoare triple {4040#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:15,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {4044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:15,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {4048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3879#false} is VALID [2022-04-27 14:36:15,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {3879#false} assume !false; {3879#false} is VALID [2022-04-27 14:36:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-27 14:36:15,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:36:43,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {3879#false} assume !false; {3879#false} is VALID [2022-04-27 14:36:43,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {4048#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3879#false} is VALID [2022-04-27 14:36:43,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {4044#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4048#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:36:43,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {4064#(= (+ 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)); {4044#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:36:43,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {4064#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4064#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:36:43,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {4071#(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); {4064#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 14:36:43,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {4075#(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)); {4071#(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-27 14:36:43,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {4075#(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); {4075#(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-27 14:36:43,877 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} {4082#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {4075#(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-27 14:36:43,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:43,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {4092#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:36:43,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {3878#true} ~cond := #in~cond; {4092#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:36:43,878 INFO L272 TraceCheckUtils]: 42: Hoare triple {4082#(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)); {3878#true} is VALID [2022-04-27 14:36:43,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {4082#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4082#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:36:43,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {4102#(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); {4082#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-27 14:36:43,880 INFO L290 TraceCheckUtils]: 39: Hoare triple {3878#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; {4102#(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-27 14:36:43,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {3878#true} assume !!(0 != ~y~0); {3878#true} is VALID [2022-04-27 14:36:43,880 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3878#true} {3878#true} #67#return; {3878#true} is VALID [2022-04-27 14:36:43,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L272 TraceCheckUtils]: 33: Hoare triple {3878#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {3878#true} assume !false; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {3878#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); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {3878#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {3878#true} assume !!(0 != ~y~0); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3878#true} {3878#true} #67#return; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L272 TraceCheckUtils]: 24: Hoare triple {3878#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {3878#true} assume !false; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {3878#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3878#true} {3878#true} #65#return; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {3878#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3878#true} {3878#true} #63#return; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L272 TraceCheckUtils]: 12: Hoare triple {3878#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {3878#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3878#true} {3878#true} #61#return; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {3878#true} assume !(0 == ~cond); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {3878#true} ~cond := #in~cond; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {3878#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {3878#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; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {3878#true} call #t~ret6 := main(); {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3878#true} {3878#true} #71#return; {3878#true} is VALID [2022-04-27 14:36:43,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {3878#true} assume true; {3878#true} is VALID [2022-04-27 14:36:43,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {3878#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); {3878#true} is VALID [2022-04-27 14:36:43,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {3878#true} call ULTIMATE.init(); {3878#true} is VALID [2022-04-27 14:36:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 14:36:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:36:43,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203845907] [2022-04-27 14:36:43,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:36:43,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492714502] [2022-04-27 14:36:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492714502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:36:43,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:36:43,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-27 14:36:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872401753] [2022-04-27 14:36:43,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:36:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2022-04-27 14:36:43,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:36:43,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:36:46,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:36:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 14:36:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:36:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 14:36:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=239, Unknown=4, NotChecked=0, Total=306 [2022-04-27 14:36:46,144 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:36:59,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:04,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:07,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:37:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:17,015 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-04-27 14:37:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 14:37:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2022-04-27 14:37:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:37:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-27 14:37:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:37:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-27 14:37:17,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-27 14:37:22,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:22,028 INFO L225 Difference]: With dead ends: 90 [2022-04-27 14:37:22,028 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 14:37:22,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=107, Invalid=395, Unknown=4, NotChecked=0, Total=506 [2022-04-27 14:37:22,029 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:22,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 220 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 12 Unchecked, 9.1s Time] [2022-04-27 14:37:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 14:37:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 14:37:22,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:22,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:22,049 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:22,049 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:22,050 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-27 14:37:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 14:37:22,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:22,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:22,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 14:37:22,051 INFO L87 Difference]: Start difference. First operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 14:37:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:22,052 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-27 14:37:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 14:37:22,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:22,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:22,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:22,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:37:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-27 14:37:22,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 55 [2022-04-27 14:37:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:22,053 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-27 14:37:22,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 14:37:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 14:37:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 14:37:22,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:37:22,054 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:37:22,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 14:37:22,270 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-27 14:37:22,271 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:37:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:37:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1351365048, now seen corresponding path program 2 times [2022-04-27 14:37:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:37:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530256342] [2022-04-27 14:37:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:37:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:37:22,281 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:37:22,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593620261] [2022-04-27 14:37:22,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:37:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:37:22,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:37:22,282 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-27 14:37:22,283 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-27 14:37:22,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:37:22,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:37:22,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 14:37:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:37:22,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:37:23,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-27 14:37:23,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#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); {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #71#return; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret6 := main(); {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#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; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {4535#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 10 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4535#true} {4535#true} #61#return; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {4535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L272 TraceCheckUtils]: 12: Hoare triple {4535#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 10 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {4535#true} ~cond := #in~cond; {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:37:23,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:37:23,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:37:23,584 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} {4535#true} #63#return; {4590#(and (<= 0 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:37:23,584 INFO L272 TraceCheckUtils]: 17: Hoare triple {4590#(and (<= 0 main_~b~0) (<= main_~b~0 10))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {4535#true} ~cond := #in~cond; {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:37:23,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {4579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:37:23,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:37:23,585 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4583#(not (= |assume_abort_if_not_#in~cond| 0))} {4590#(and (<= 0 main_~b~0) (<= main_~b~0 10))} #65#return; {4606#(and (<= 1 main_~b~0) (<= main_~b~0 10))} is VALID [2022-04-27 14:37:23,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {4606#(and (<= 1 main_~b~0) (<= main_~b~0 10))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-27 14:37:23,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} assume !false; {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-27 14:37:23,586 INFO L272 TraceCheckUtils]: 24: Hoare triple {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-27 14:37:23,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-27 14:37:23,586 INFO L290 TraceCheckUtils]: 27: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,586 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4535#true} {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} #67#return; {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-27 14:37:23,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} assume !!(0 != ~y~0); {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} is VALID [2022-04-27 14:37:23,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {4610#(and (<= main_~y~0 10) (<= 1 main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4635#(and (<= main_~y~0 10) (not (= (mod main_~y~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-27 14:37:23,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {4635#(and (<= main_~y~0 10) (not (= (mod main_~y~0 2) 1)) (<= 1 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); {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} assume !false; {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,589 INFO L272 TraceCheckUtils]: 33: Hoare triple {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-27 14:37:23,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-27 14:37:23,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,597 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4535#true} {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} #67#return; {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,597 INFO L290 TraceCheckUtils]: 38: Hoare triple {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} assume !!(0 != ~y~0); {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,598 INFO L290 TraceCheckUtils]: 39: Hoare triple {4639#(and (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4664#(and (not (= (mod main_~y~0 2) 1)) (<= (* main_~y~0 2) 10) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,599 INFO L290 TraceCheckUtils]: 40: Hoare triple {4664#(and (not (= (mod main_~y~0 2) 1)) (<= (* main_~y~0 2) 10) (< 0 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); {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,599 INFO L290 TraceCheckUtils]: 41: Hoare triple {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} assume !false; {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,599 INFO L272 TraceCheckUtils]: 42: Hoare triple {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-27 14:37:23,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-27 14:37:23,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,602 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4535#true} {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} #67#return; {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} assume !!(0 != ~y~0); {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {4668#(and (< main_~y~0 3) (< 0 main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4693#(and (not (= (mod main_~y~0 2) 1)) (< main_~y~0 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {4693#(and (not (= (mod main_~y~0 2) 1)) (< main_~y~0 3) (< 0 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); {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,605 INFO L290 TraceCheckUtils]: 50: Hoare triple {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} assume !false; {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,605 INFO L272 TraceCheckUtils]: 51: Hoare triple {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-27 14:37:23,605 INFO L290 TraceCheckUtils]: 52: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-27 14:37:23,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-27 14:37:23,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-27 14:37:23,606 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4535#true} {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} #67#return; {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,606 INFO L290 TraceCheckUtils]: 56: Hoare triple {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} assume !!(0 != ~y~0); {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {4697#(and (< (* main_~y~0 2) 3) (< 0 main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 58: Hoare triple {4536#false} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 59: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L272 TraceCheckUtils]: 60: Hoare triple {4536#false} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 61: Hoare triple {4536#false} ~cond := #in~cond; {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {4536#false} assume 0 == ~cond; {4536#false} is VALID [2022-04-27 14:37:23,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-27 14:37:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 14:37:23,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:37:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:37:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530256342] [2022-04-27 14:37:23,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:37:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593620261] [2022-04-27 14:37:23,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593620261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:37:23,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:37:23,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-27 14:37:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756645732] [2022-04-27 14:37:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:37:23,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 64 [2022-04-27 14:37:23,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:37:23,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:37:23,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:37:23,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 14:37:23,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:37:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 14:37:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 14:37:23,658 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:37:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,173 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 14:37:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:37:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 64 [2022-04-27 14:37:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:37:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:37:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-27 14:37:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:37:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-27 14:37:24,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-27 14:37:24,213 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-27 14:37:24,213 INFO L225 Difference]: With dead ends: 53 [2022-04-27 14:37:24,213 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:37:24,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-27 14:37:24,214 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:37:24,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 122 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:37:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:37:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:37:24,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:37:24,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:37:24,215 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:37:24,215 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:37:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,215 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:37:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:24,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:24,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:24,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:37:24,215 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 14:37:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:37:24,215 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:37:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:24,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:24,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:37:24,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:37:24,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:37:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 14:37:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:37:24,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-04-27 14:37:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:37:24,216 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:37:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 7 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-04-27 14:37:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:37:24,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:37:24,218 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:37:24,234 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-27 14:37:24,418 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-27 14:37:24,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 14:37:32,228 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-27 14:37:32,228 INFO L895 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= 0 main_~b~0) (<= main_~b~0 10)) [2022-04-27 14:37:32,229 INFO L902 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse2 (* main_~b~0 main_~a~0))) (let ((.cse1 (<= main_~b~0 10)) (.cse4 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse2)) (.cse0 (<= 1 main_~b~0)) (.cse3 (< 0 (+ main_~y~0 1)))) (or (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)) .cse0 .cse1) (and (<= main_~y~0 4) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse2) .cse0 .cse3 (= (mod main_~x~0 2) 0)) (and .cse4 (< main_~y~0 3) (< 0 main_~y~0) .cse0 .cse1) (and .cse4 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse1 (= main_~a~0 main_~x~0)) (and .cse4 .cse0 .cse3 (<= (* main_~y~0 2) 3))))) [2022-04-27 14:37:32,229 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= 1 main_~b~0))) [2022-04-27 14:37:32,229 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L28(line 28) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 42) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (* main_~b~0 main_~a~0))) (let ((.cse1 (<= main_~b~0 10)) (.cse4 (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse2)) (.cse0 (<= 1 main_~b~0)) (.cse3 (< 0 (+ main_~y~0 1)))) (or (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)) .cse0 .cse1) (and (<= main_~y~0 4) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse2) .cse0 .cse3 (= (mod main_~x~0 2) 0)) (and .cse4 (< main_~y~0 3) (< 0 main_~y~0) .cse0 .cse1) (and .cse4 (= main_~b~0 main_~y~0) (<= 1 main_~y~0) .cse1 (= main_~a~0 main_~x~0)) (and .cse4 .cse0 .cse3 (<= (* main_~y~0 2) 3))))) [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 45) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:37:32,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:37:32,230 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point L14(lines 14 15) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 16) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2022-04-27 14:37:32,230 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-04-27 14:37:32,232 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-04-27 14:37:32,233 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:37:32,237 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:37:32,237 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 14:37:32,249 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:37:32,250 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 14:37:32,257 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:37:32,257 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:37:32,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:37:32 BoogieIcfgContainer [2022-04-27 14:37:32,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:37:32,264 INFO L158 Benchmark]: Toolchain (without parser) took 620712.35ms. Allocated memory was 183.5MB in the beginning and 320.9MB in the end (delta: 137.4MB). Free memory was 129.1MB in the beginning and 191.4MB in the end (delta: -62.3MB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. [2022-04-27 14:37:32,265 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory was 145.6MB in the beginning and 145.4MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:37:32,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.77ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 154.4MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-04-27 14:37:32,265 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 183.5MB. Free memory was 154.4MB in the beginning and 153.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:37:32,265 INFO L158 Benchmark]: RCFGBuilder took 229.80ms. Allocated memory is still 183.5MB. Free memory was 152.8MB in the beginning and 141.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:37:32,265 INFO L158 Benchmark]: TraceAbstraction took 620281.66ms. Allocated memory was 183.5MB in the beginning and 320.9MB in the end (delta: 137.4MB). Free memory was 140.8MB in the beginning and 191.4MB in the end (delta: -50.6MB). Peak memory consumption was 86.8MB. Max. memory is 8.0GB. [2022-04-27 14:37:32,266 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory was 145.6MB in the beginning and 145.4MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.77ms. Allocated memory is still 183.5MB. Free memory was 129.0MB in the beginning and 154.4MB in the end (delta: -25.4MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 183.5MB. Free memory was 154.4MB in the beginning and 153.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 229.80ms. Allocated memory is still 183.5MB. Free memory was 152.8MB in the beginning and 141.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 620281.66ms. Allocated memory was 183.5MB in the beginning and 320.9MB in the end (delta: 137.4MB). Free memory was 140.8MB in the beginning and 191.4MB in the end (delta: -50.6MB). Peak memory consumption was 86.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 620.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 94.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 1454 SdHoareTripleChecker+Invalid, 30.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 125 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1547 IncrementalHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 253 mSDtfsCounter, 1547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 526 SyntacticMatches, 19 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=8, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 34 PreInvPairs, 59 NumberOfFragments, 291 HoareAnnotationTreeSize, 34 FomulaSimplifications, 127 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1129 FormulaSimplificationTreeSizeReductionInter, 7.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 507.8s InterpolantComputationTime, 436 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 648 ConstructedInterpolants, 7 QuantifiedInterpolants, 3237 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1102 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 422/485 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((z == 0 && y == b / 2) && a * 2 == x) && !(b % 2 == 1)) && 1 <= b) && b <= 10) || ((((y <= 4 && z + 2 * (-1 * x / -2 * y) == b * a) && 1 <= b) && 0 < y + 1) && x % 2 == 0)) || ((((z + y * x == b * a && y < 3) && 0 < y) && 1 <= b) && b <= 10)) || ((((z + y * x == b * a && b == y) && 1 <= y) && b <= 10) && a == x)) || (((z + y * x == b * a && 1 <= b) && 0 < y + 1) && y * 2 <= 3) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:37:32,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...