/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/prod4br-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:24:50,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:24:50,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:24:50,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:24:50,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:24:50,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:24:50,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:24:50,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:24:50,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:24:50,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:24:50,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:24:50,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:24:50,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:24:50,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:24:50,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:24:50,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:24:50,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:24:50,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:24:50,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:24:50,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:24:50,481 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:24:50,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:24:50,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:24:50,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:24:50,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:24:50,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:24:50,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:24:50,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:24:50,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:24:50,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:24:50,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:24:50,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:24:50,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:24:50,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:24:50,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:24:50,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:24:50,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:24:50,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:24:50,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:24:50,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:24:50,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:24:50,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:24:50,492 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:24:50,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:24:50,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:24:50,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:24:50,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:24:50,515 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:24:50,515 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:24:50,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:24:50,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:24:50,516 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:24:50,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:24:50,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:24:50,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:24:50,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:24:50,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:24:50,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:24:50,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:24:50,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:24:50,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:24:50,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:24:50,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:24:50,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:24:50,519 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:24:50,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:24:50,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:24:50,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:24:50,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:24:50,674 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:24:50,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-27 14:24:50,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9d8db6a/cecd4e40cb2f4d56b9017c77f1b0b3ec/FLAGbb5e861dc [2022-04-27 14:24:51,064 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:24:51,064 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound1.c [2022-04-27 14:24:51,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9d8db6a/cecd4e40cb2f4d56b9017c77f1b0b3ec/FLAGbb5e861dc [2022-04-27 14:24:51,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d9d8db6a/cecd4e40cb2f4d56b9017c77f1b0b3ec [2022-04-27 14:24:51,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:24:51,492 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:24:51,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:24:51,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:24:51,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:24:51,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e8ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51, skipping insertion in model container [2022-04-27 14:24:51,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:24:51,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:24:51,644 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/prod4br-ll_valuebound1.c[524,537] [2022-04-27 14:24:51,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:24:51,682 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:24:51,692 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/prod4br-ll_valuebound1.c[524,537] [2022-04-27 14:24:51,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:24:51,721 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:24:51,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51 WrapperNode [2022-04-27 14:24:51,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:24:51,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:24:51,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:24:51,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:24:51,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:24:51,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:24:51,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:24:51,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:24:51,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (1/1) ... [2022-04-27 14:24:51,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:24:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:24:51,784 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:24:51,789 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:24:51,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:24:51,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:24:51,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:24:51,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:24:51,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:24:51,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:24:51,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:24:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:24:51,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:24:51,856 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:24:51,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:24:52,024 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:24:52,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:24:52,029 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:24:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:24:52 BoogieIcfgContainer [2022-04-27 14:24:52,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:24:52,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:24:52,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:24:52,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:24:52,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:24:51" (1/3) ... [2022-04-27 14:24:52,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51248b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:24:52, skipping insertion in model container [2022-04-27 14:24:52,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:24:51" (2/3) ... [2022-04-27 14:24:52,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51248b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:24:52, skipping insertion in model container [2022-04-27 14:24:52,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:24:52" (3/3) ... [2022-04-27 14:24:52,045 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound1.c [2022-04-27 14:24:52,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:24:52,053 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:24:52,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:24:52,085 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@705e32c4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@662659bc [2022-04-27 14:24:52,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:24:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:24:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:24:52,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:24:52,096 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:24:52,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:24:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:24:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-27 14:24:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:24:52,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804605455] [2022-04-27 14:24:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:24:52,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:24:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:24:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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); {37#true} is VALID [2022-04-27 14:24:52,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:24:52,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-27 14:24:52,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:24:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-27 14:24:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:24:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:24:52,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:24:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-27 14:24:52,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:24:52,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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); {37#true} is VALID [2022-04-27 14:24:52,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:24:52,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-27 14:24:52,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-27 14:24:52,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-27 14:24:52,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:24:52,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-27 14:24:52,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-27 14:24:52,335 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:24:52,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,336 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:24:52,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:24:52,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:24:52,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:24:52,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:24:52,337 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-27 14:24:52,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-27 14:24:52,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 14:24:52,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-27 14:24:52,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 14:24:52,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 14:24:52,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 14:24:52,338 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:24:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:24:52,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804605455] [2022-04-27 14:24:52,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804605455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:24:52,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:24:52,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:24:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976236484] [2022-04-27 14:24:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:24:52,344 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:24:52,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:24:52,347 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:24:52,367 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:24:52,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:24:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:24:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:24:52,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:24:52,393 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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:24:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:52,534 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-27 14:24:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:24:52,534 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:24:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:24:52,535 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:24:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-27 14:24:52,546 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:24:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-27 14:24:52,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-27 14:24:52,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:24:52,635 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:24:52,635 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:24:52,637 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:24:52,639 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:24:52,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:24:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:24:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:24:52,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:24:52,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:24:52,659 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:24:52,659 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:24:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:52,662 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:24:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:24:52,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:24:52,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:24:52,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:24:52,663 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:24:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:52,666 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:24:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:24:52,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:24:52,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:24:52,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:24:52,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:24:52,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:24:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-27 14:24:52,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-27 14:24:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:24:52,669 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-27 14:24:52,670 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:24:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:24:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:24:52,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:24:52,670 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:24:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:24:52,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:24:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:24:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-27 14:24:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:24:52,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285063935] [2022-04-27 14:24:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:24:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:24:52,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:24:52,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307026514] [2022-04-27 14:24:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:24:52,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:24:52,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:24:52,689 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:24:52,694 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:24:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 14:24:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:52,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:24:53,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-27 14:24:53,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-27 14:24:53,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:24:53,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-27 14:24:53,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-27 14:24:53,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {239#true} is VALID [2022-04-27 14:24:53,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {239#true} is VALID [2022-04-27 14:24:53,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:24:53,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} #71#return; {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:24:53,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:24:53,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {239#true} is VALID [2022-04-27 14:24:53,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:24:53,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,216 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-27 14:24:53,216 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-27 14:24:53,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:24:53,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:24:53,219 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {295#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} #75#return; {311#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 14:24:53,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:24:53,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:24:53,221 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#(and (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:24:53,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:24:53,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-27 14:24:53,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-27 14:24:53,222 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:24:53,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:24:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:24:53,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285063935] [2022-04-27 14:24:53,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:24:53,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307026514] [2022-04-27 14:24:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307026514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:24:53,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:24:53,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 14:24:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728622283] [2022-04-27 14:24:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:24:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 14:24:53,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:24:53,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:24:53,247 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:24:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 14:24:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:24:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 14:24:53,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:24:53,250 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:24:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:53,625 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2022-04-27 14:24:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 14:24:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 14:24:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:24:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:24:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-27 14:24:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:24:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-04-27 14:24:53,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-04-27 14:24:53,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:24:53,694 INFO L225 Difference]: With dead ends: 55 [2022-04-27 14:24:53,694 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 14:24:53,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:24:53,696 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:24:53,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 118 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:24:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 14:24:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-27 14:24:53,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:24:53,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:24:53,721 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:24:53,722 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:24:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:53,730 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 14:24:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 14:24:53,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:24:53,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:24:53,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:24:53,737 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:24:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:24:53,739 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-27 14:24:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-27 14:24:53,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:24:53,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:24:53,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:24:53,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:24:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:24:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-04-27 14:24:53,742 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2022-04-27 14:24:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:24:53,742 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-04-27 14:24:53,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 14:24:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-04-27 14:24:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:24:53,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:24:53,743 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:24:53,763 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:24:53,943 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:24:53,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:24:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:24:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-27 14:24:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:24:53,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536894231] [2022-04-27 14:24:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:24:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:24:53,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:24:53,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712028716] [2022-04-27 14:24:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:24:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:24:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:24:53,959 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:24:53,967 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:24:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:54,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 14:24:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:24:54,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:25:04,229 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:25:04,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2022-04-27 14:25:04,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#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); {550#true} is VALID [2022-04-27 14:25:04,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:04,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-27 14:25:04,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret6 := main(); {550#true} is VALID [2022-04-27 14:25:04,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {550#true} is VALID [2022-04-27 14:25:04,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {550#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:04,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2022-04-27 14:25:04,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} assume !(0 == ~cond); {550#true} is VALID [2022-04-27 14:25:04,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:04,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {550#true} {550#true} #71#return; {550#true} is VALID [2022-04-27 14:25:04,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {550#true} is VALID [2022-04-27 14:25:04,676 INFO L272 TraceCheckUtils]: 12: Hoare triple {550#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:04,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2022-04-27 14:25:04,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#true} assume !(0 == ~cond); {550#true} is VALID [2022-04-27 14:25:04,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:04,677 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {550#true} {550#true} #73#return; {550#true} is VALID [2022-04-27 14:25:04,677 INFO L272 TraceCheckUtils]: 17: Hoare triple {550#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:04,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {550#true} ~cond := #in~cond; {609#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:25:04,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {609#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {613#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:04,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {613#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {613#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:04,679 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {613#(not (= |assume_abort_if_not_#in~cond| 0))} {550#true} #75#return; {620#(<= 1 main_~y~0)} is VALID [2022-04-27 14:25:04,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {620#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:25:04,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:25:04,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:04,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {550#true} ~cond := #in~cond; {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:25:04,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {634#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:04,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:06,696 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {624#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {645#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-27 14:25:06,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {645#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {649#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:25:06,698 INFO L272 TraceCheckUtils]: 30: Hoare triple {649#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:25:06,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:25:06,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {551#false} is VALID [2022-04-27 14:25:06,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-27 14:25:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:25:06,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:25:33,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-27 14:25:33,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {551#false} is VALID [2022-04-27 14:25:33,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:25:33,203 INFO L272 TraceCheckUtils]: 30: Hoare triple {673#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:25:33,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {677#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {673#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:25:33,204 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} {550#true} #77#return; {677#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-27 14:25:33,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {690#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {550#true} ~cond := #in~cond; {690#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:25:33,205 INFO L272 TraceCheckUtils]: 24: Hoare triple {550#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {550#true} assume !false; {550#true} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {550#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {550#true} is VALID [2022-04-27 14:25:33,205 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {550#true} {550#true} #75#return; {550#true} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:33,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {550#true} assume !(0 == ~cond); {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L272 TraceCheckUtils]: 17: Hoare triple {550#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:33,206 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {550#true} {550#true} #73#return; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {550#true} assume !(0 == ~cond); {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L272 TraceCheckUtils]: 12: Hoare triple {550#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {550#true} {550#true} #71#return; {550#true} is VALID [2022-04-27 14:25:33,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:33,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} assume !(0 == ~cond); {550#true} is VALID [2022-04-27 14:25:33,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2022-04-27 14:25:33,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {550#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {550#true} is VALID [2022-04-27 14:25:33,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {550#true} is VALID [2022-04-27 14:25:33,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret6 := main(); {550#true} is VALID [2022-04-27 14:25:33,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-27 14:25:33,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-27 14:25:33,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#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); {550#true} is VALID [2022-04-27 14:25:33,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2022-04-27 14:25:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:25:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:25:33,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536894231] [2022-04-27 14:25:33,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:25:33,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712028716] [2022-04-27 14:25:33,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712028716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:25:33,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:25:33,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-27 14:25:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415135400] [2022-04-27 14:25:33,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:25:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-27 14:25:33,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:25:33,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:25:35,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:25:35,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:25:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:25:35,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:25:35,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:25:35,237 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:25:41,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:25:43,939 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:25:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:43,944 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 14:25:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:25:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-27 14:25:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:25:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:25:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:25:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:25:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-27 14:25:43,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-27 14:25:44,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:25:44,005 INFO L225 Difference]: With dead ends: 49 [2022-04-27 14:25:44,005 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:25:44,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:25:44,006 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-27 14:25:44,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 223 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-27 14:25:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:25:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-27 14:25:44,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:25:44,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:44,032 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:44,032 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:44,034 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 14:25:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 14:25:44,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:25:44,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:25:44,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-27 14:25:44,040 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-27 14:25:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:44,046 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 14:25:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-04-27 14:25:44,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:25:44,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:25:44,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:25:44,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:25:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-04-27 14:25:44,049 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2022-04-27 14:25:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:25:44,050 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-04-27 14:25:44,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:25:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-04-27 14:25:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 14:25:44,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:25:44,052 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, 1] [2022-04-27 14:25:44,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:25:44,253 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:25:44,253 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:25:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:25:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-27 14:25:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:25:44,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181092985] [2022-04-27 14:25:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:25:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:25:44,271 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:25:44,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337069269] [2022-04-27 14:25:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:25:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:25:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:25:44,273 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:25:44,273 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:25:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:25:44,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 14:25:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:25:44,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:25:44,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#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); {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #83#return; {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} call #t~ret6 := main(); {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} ~cond := #in~cond; {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:25:44,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1029#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:44,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:44,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} #71#return; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:44,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:44,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,579 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1003#true} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:44,579 INFO L272 TraceCheckUtils]: 17: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,580 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1003#true} {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #75#return; {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:44,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {1040#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-27 14:25:44,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} assume !false; {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-27 14:25:44,581 INFO L272 TraceCheckUtils]: 24: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,582 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1003#true} {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} #77#return; {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} is VALID [2022-04-27 14:25:44,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {1077#(and (<= main_~a~0 1) (<= 0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:25:44,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:25:44,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:25:44,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {1099#(and (<= main_~a~0 1) (<= 0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {1004#false} is VALID [2022-04-27 14:25:44,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2022-04-27 14:25:44,584 INFO L272 TraceCheckUtils]: 34: Hoare triple {1004#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1004#false} is VALID [2022-04-27 14:25:44,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#false} ~cond := #in~cond; {1004#false} is VALID [2022-04-27 14:25:44,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#false} assume 0 == ~cond; {1004#false} is VALID [2022-04-27 14:25:44,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2022-04-27 14:25:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:25:44,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:25:44,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2022-04-27 14:25:44,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1004#false} assume 0 == ~cond; {1004#false} is VALID [2022-04-27 14:25:44,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1004#false} ~cond := #in~cond; {1004#false} is VALID [2022-04-27 14:25:44,954 INFO L272 TraceCheckUtils]: 34: Hoare triple {1004#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1004#false} is VALID [2022-04-27 14:25:44,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {1004#false} assume !false; {1004#false} is VALID [2022-04-27 14:25:44,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {1004#false} is VALID [2022-04-27 14:25:44,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-27 14:25:44,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {1139#(not (= (mod main_~a~0 2) 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-27 14:25:44,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1139#(not (= (mod main_~a~0 2) 0))} is VALID [2022-04-27 14:25:44,957 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1003#true} {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:25:44,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,958 INFO L272 TraceCheckUtils]: 24: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:25:44,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1149#(or (= main_~a~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:25:44,960 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1003#true} {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} #75#return; {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-27 14:25:44,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L272 TraceCheckUtils]: 17: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1003#true} {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} #73#return; {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-27 14:25:44,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#true} assume !(0 == ~cond); {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {1003#true} ~cond := #in~cond; {1003#true} is VALID [2022-04-27 14:25:44,961 INFO L272 TraceCheckUtils]: 12: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-27 14:25:44,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} {1003#true} #71#return; {1171#(or (= main_~x~0 0) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-27 14:25:44,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:44,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:44,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1003#true} ~cond := #in~cond; {1217#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:25:44,973 INFO L272 TraceCheckUtils]: 6: Hoare triple {1003#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1003#true} is VALID [2022-04-27 14:25:44,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1003#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1003#true} is VALID [2022-04-27 14:25:44,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {1003#true} call #t~ret6 := main(); {1003#true} is VALID [2022-04-27 14:25:44,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1003#true} {1003#true} #83#return; {1003#true} is VALID [2022-04-27 14:25:44,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#true} assume true; {1003#true} is VALID [2022-04-27 14:25:44,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#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); {1003#true} is VALID [2022-04-27 14:25:44,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {1003#true} call ULTIMATE.init(); {1003#true} is VALID [2022-04-27 14:25:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:25:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:25:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181092985] [2022-04-27 14:25:44,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:25:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337069269] [2022-04-27 14:25:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337069269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:25:44,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:25:44,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-04-27 14:25:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549694969] [2022-04-27 14:25:44,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:25:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-27 14:25:44,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:25:44,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:25:45,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:25:45,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 14:25:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:25:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 14:25:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:25:45,014 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:25:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:45,259 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-04-27 14:25:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:25:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 38 [2022-04-27 14:25:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:25:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:25:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 14:25:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:25:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 14:25:45,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 14:25:45,301 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:25:45,302 INFO L225 Difference]: With dead ends: 60 [2022-04-27 14:25:45,302 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 14:25:45,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 14:25:45,303 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:25:45,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 115 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:25:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 14:25:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-27 14:25:45,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:25:45,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:45,329 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:45,329 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:45,331 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:25:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 14:25:45,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:25:45,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:25:45,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-27 14:25:45,332 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 42 states. [2022-04-27 14:25:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:25:45,333 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-27 14:25:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 14:25:45,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:25:45,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:25:45,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:25:45,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:25:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:25:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 14:25:45,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 38 [2022-04-27 14:25:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:25:45,335 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 14:25:45,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 6 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:25:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 14:25:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 14:25:45,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:25:45,335 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, 1] [2022-04-27 14:25:45,364 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:25:45,551 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:25:45,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:25:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:25:45,552 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-27 14:25:45,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:25:45,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737939629] [2022-04-27 14:25:45,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:25:45,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:25:45,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:25:45,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62011874] [2022-04-27 14:25:45,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:25:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:25:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:25:45,569 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:25:45,570 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:25:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:25:45,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-27 14:25:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:25:45,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:25:46,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1473#true} call ULTIMATE.init(); {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#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); {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1473#true} {1473#true} #83#return; {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {1473#true} call #t~ret6 := main(); {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {1473#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1473#true} is VALID [2022-04-27 14:25:46,488 INFO L272 TraceCheckUtils]: 6: Hoare triple {1473#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:25:46,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {1473#true} ~cond := #in~cond; {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:25:46,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:46,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:46,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} {1473#true} #71#return; {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:46,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 14:25:46,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:25:46,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#true} ~cond := #in~cond; {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:25:46,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:46,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1503#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:25:46,500 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1503#(not (= |assume_abort_if_not_#in~cond| 0))} {1510#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #73#return; {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-27 14:25:46,500 INFO L272 TraceCheckUtils]: 17: Hoare triple {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:25:46,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#true} ~cond := #in~cond; {1473#true} is VALID [2022-04-27 14:25:46,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#true} assume !(0 == ~cond); {1473#true} is VALID [2022-04-27 14:25:46,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:25:46,501 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#true} {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} #75#return; {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} is VALID [2022-04-27 14:25:46,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {1529#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,502 INFO L272 TraceCheckUtils]: 24: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:25:46,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#true} ~cond := #in~cond; {1558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:25:46,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {1558#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:46,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:25:46,503 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #77#return; {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {1548#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {1572#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (not (= main_~a~0 0)) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 14:25:46,510 INFO L272 TraceCheckUtils]: 34: Hoare triple {1582#(and (<= 0 main_~y~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (not (= (+ main_~b~0 1) 0)) (<= 0 main_~x~0) (<= main_~x~0 1) (= (+ main_~a~0 1) main_~x~0) (= (+ main_~b~0 1) main_~y~0) (not (= (+ main_~a~0 1) 0)) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:25:46,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:25:46,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1474#false} is VALID [2022-04-27 14:25:46,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {1474#false} assume !false; {1474#false} is VALID [2022-04-27 14:25:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:25:46,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:26:08,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {1474#false} assume !false; {1474#false} is VALID [2022-04-27 14:26:08,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {1593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1474#false} is VALID [2022-04-27 14:26:08,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:08,896 INFO L272 TraceCheckUtils]: 34: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:08,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:08,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:08,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:08,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:08,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1609#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:08,902 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} {1473#true} #77#return; {1625#(or (= main_~a~0 0) (= main_~b~0 0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)))} is VALID [2022-04-27 14:26:08,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:08,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {1638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:08,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#true} ~cond := #in~cond; {1638#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:26:08,903 INFO L272 TraceCheckUtils]: 24: Hoare triple {1473#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:26:08,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {1473#true} assume !false; {1473#true} is VALID [2022-04-27 14:26:08,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {1473#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1473#true} is VALID [2022-04-27 14:26:08,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#true} {1473#true} #75#return; {1473#true} is VALID [2022-04-27 14:26:08,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#true} assume !(0 == ~cond); {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {1473#true} ~cond := #in~cond; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L272 TraceCheckUtils]: 17: Hoare triple {1473#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1473#true} {1473#true} #73#return; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {1473#true} assume !(0 == ~cond); {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#true} ~cond := #in~cond; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {1473#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {1473#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1473#true} {1473#true} #71#return; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1473#true} assume !(0 == ~cond); {1473#true} is VALID [2022-04-27 14:26:08,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {1473#true} ~cond := #in~cond; {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {1473#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1473#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1473#true} call #t~ret6 := main(); {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1473#true} {1473#true} #83#return; {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1473#true} assume true; {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1473#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); {1473#true} is VALID [2022-04-27 14:26:08,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {1473#true} call ULTIMATE.init(); {1473#true} is VALID [2022-04-27 14:26:08,905 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:26:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:08,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737939629] [2022-04-27 14:26:08,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:08,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62011874] [2022-04-27 14:26:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62011874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:26:08,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:26:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-27 14:26:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145480048] [2022-04-27 14:26:08,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:26:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-27 14:26:08,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:08,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:26:08,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:08,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 14:26:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:08,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 14:26:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-27 14:26:08,950 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:26:09,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:09,503 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-27 14:26:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 14:26:09,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 38 [2022-04-27 14:26:09,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:26:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-27 14:26:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:26:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-27 14:26:09,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-27 14:26:09,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:09,556 INFO L225 Difference]: With dead ends: 56 [2022-04-27 14:26:09,556 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:26:09,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-27 14:26:09,558 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:09,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 132 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:26:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:26:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:26:09,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:09,562 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:26:09,562 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:26:09,562 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:26:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:09,562 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:26:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:26:09,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:09,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:09,563 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:26:09,563 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:26:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:09,563 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:26:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:26:09,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:09,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:09,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:09,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:09,563 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:26:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:26:09,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-27 14:26:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:09,564 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:26:09,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-27 14:26:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:26:09,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:09,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:26:09,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:26:09,779 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:26:09,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:26:10,196 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:26:10,196 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-27 14:26:10,197 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (<= main_~y~0 1))) (or (and (= main_~a~0 0) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~q~0 0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~b~0) .cse0 .cse1) (and (<= main_~x~0 1) (<= 0 main_~a~0) (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse0 (= (+ main_~b~0 1) main_~y~0) .cse1 (= main_~p~0 1)))) [2022-04-27 14:26:10,197 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-27 14:26:10,197 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-27 14:26:10,197 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-27 14:26:10,198 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (<= main_~y~0 1))) (or (and (= main_~a~0 0) (<= 1 main_~p~0) (<= 0 main_~x~0) (<= main_~q~0 0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~b~0) .cse0 .cse1) (and (<= main_~x~0 1) (<= 0 main_~a~0) (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) .cse0 (= (+ main_~b~0 1) main_~y~0) .cse1 (= main_~p~0 1)))) [2022-04-27 14:26:10,198 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (let ((.cse1 (<= main_~x~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (let ((.cse0 (+ main_~b~0 1))) (and (<= 0 main_~y~0) (not (= .cse0 0)) .cse1 .cse2 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) (= .cse0 main_~y~0) .cse3 .cse4)) (and .cse1 (= main_~b~0 main_~y~0) .cse2 (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-27 14:26:10,198 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse1 (<= main_~x~0 1)) (.cse2 (<= 0 main_~a~0)) (.cse3 (<= main_~y~0 1)) (.cse4 (= main_~p~0 1))) (or (let ((.cse0 (+ main_~b~0 1))) (and (<= 0 main_~y~0) (not (= .cse0 0)) .cse1 .cse2 (= (+ main_~a~0 1) main_~x~0) (= main_~q~0 (+ (* main_~b~0 main_~p~0) (* main_~a~0 main_~p~0) main_~p~0)) (= .cse0 main_~y~0) .cse3 .cse4)) (and .cse1 (= main_~b~0 main_~y~0) .cse2 (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) .cse3 .cse4))) [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:26:10,198 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:26:10,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:26:10,198 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:26:10,198 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:26:10,199 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:26:10,199 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:26:10,199 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:26:10,201 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 14:26:10,202 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:26:10,204 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:26:10,204 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:26:10,205 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 14:26:10,206 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 14:26:10,210 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 14:26:10,210 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:26:10,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:26:10 BoogieIcfgContainer [2022-04-27 14:26:10,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:26:10,217 INFO L158 Benchmark]: Toolchain (without parser) took 78724.99ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 141.6MB in the beginning and 160.4MB in the end (delta: -18.9MB). Peak memory consumption was 43.8MB. Max. memory is 8.0GB. [2022-04-27 14:26:10,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:26:10,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 191.9MB. Free memory was 141.4MB in the beginning and 165.7MB in the end (delta: -24.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 14:26:10,217 INFO L158 Benchmark]: Boogie Preprocessor took 40.33ms. Allocated memory is still 191.9MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:26:10,217 INFO L158 Benchmark]: RCFGBuilder took 268.57ms. Allocated memory is still 191.9MB. Free memory was 164.1MB in the beginning and 151.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 14:26:10,218 INFO L158 Benchmark]: TraceAbstraction took 78184.18ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 151.0MB in the beginning and 160.4MB in the end (delta: -9.5MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. [2022-04-27 14:26:10,218 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.09ms. Allocated memory is still 191.9MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 191.9MB. Free memory was 141.4MB in the beginning and 165.7MB in the end (delta: -24.2MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.33ms. Allocated memory is still 191.9MB. Free memory was 165.7MB in the beginning and 164.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.57ms. Allocated memory is still 191.9MB. Free memory was 164.1MB in the beginning and 151.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 78184.18ms. Allocated memory was 191.9MB in the beginning and 253.8MB in the end (delta: 61.9MB). Free memory was 151.0MB in the beginning and 160.4MB in the end (delta: -9.5MB). Peak memory consumption was 53.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 397 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 633 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 121 mSDtfsCounter, 633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 34 PreInvPairs, 44 NumberOfFragments, 297 HoareAnnotationTreeSize, 34 FomulaSimplifications, 88 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 374 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 63.8s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 18 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 92/116 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: ((((((((0 <= y && !(b + 1 == 0)) && x <= 1) && 0 <= a) && a + 1 == x) && q == b * p + a * p + p) && b + 1 == y) && y <= 1) && p == 1) || (((((((x <= 1 && b == y) && 0 <= a) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:26:10,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...