./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 879a640f466eee273c1bfb9ec38819f0b05c8e28dd65a68aba774d943b257ad3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:38:15,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:38:15,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:38:15,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:38:15,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:38:15,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:38:15,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:38:15,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:38:15,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:38:15,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:38:15,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:38:15,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:38:15,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:38:15,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:38:15,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:38:15,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:38:15,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:38:15,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:38:15,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:38:15,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:38:15,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:38:15,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:38:15,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:38:15,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:38:15,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:38:15,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:38:15,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:38:15,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:38:15,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:38:15,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:38:15,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:38:15,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:38:15,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:38:15,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:38:15,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:38:15,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:38:15,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:38:15,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:38:15,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:38:15,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:38:15,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:38:15,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:38:15,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:38:15,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:38:15,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:38:15,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:38:15,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:38:15,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:38:15,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:38:15,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:38:15,992 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:38:15,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:38:15,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:38:15,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:38:15,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:15,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:38:15,995 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:38:15,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:38:15,996 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 879a640f466eee273c1bfb9ec38819f0b05c8e28dd65a68aba774d943b257ad3 [2022-02-20 17:38:16,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:38:16,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:38:16,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:38:16,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:38:16,234 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:38:16,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-02-20 17:38:16,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397a0fa8d/ef6b991c610642b4b4f3c5702ce9b672/FLAG3b47451fe [2022-02-20 17:38:16,585 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:38:16,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-02-20 17:38:16,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397a0fa8d/ef6b991c610642b4b4f3c5702ce9b672/FLAG3b47451fe [2022-02-20 17:38:17,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397a0fa8d/ef6b991c610642b4b4f3c5702ce9b672 [2022-02-20 17:38:17,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:38:17,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:38:17,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:17,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:38:17,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:38:17,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615dcf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17, skipping insertion in model container [2022-02-20 17:38:17,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:38:17,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:38:17,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c[524,537] [2022-02-20 17:38:17,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:17,245 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:38:17,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_valuebound10.c[524,537] [2022-02-20 17:38:17,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:17,285 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:38:17,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17 WrapperNode [2022-02-20 17:38:17,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:17,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:17,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:38:17,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:38:17,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,330 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2022-02-20 17:38:17,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:17,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:38:17,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:38:17,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:38:17,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:38:17,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:38:17,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:38:17,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:38:17,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (1/1) ... [2022-02-20 17:38:17,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:17,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:17,378 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-02-20 17:38:17,380 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-02-20 17:38:17,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:38:17,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:38:17,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:38:17,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:38:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:38:17,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:38:17,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:38:17,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:38:17,441 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:38:17,442 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:38:17,557 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:38:17,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:38:17,562 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:38:17,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:17 BoogieIcfgContainer [2022-02-20 17:38:17,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:38:17,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:38:17,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:38:17,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:38:17,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:38:17" (1/3) ... [2022-02-20 17:38:17,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789e3408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:17, skipping insertion in model container [2022-02-20 17:38:17,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:17" (2/3) ... [2022-02-20 17:38:17,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789e3408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:17, skipping insertion in model container [2022-02-20 17:38:17,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:17" (3/3) ... [2022-02-20 17:38:17,568 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.c [2022-02-20 17:38:17,571 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:38:17,571 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:38:17,595 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:38:17,599 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:38:17,599 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:38:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:38:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:38:17,614 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:17,615 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:17,615 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1472905330, now seen corresponding path program 1 times [2022-02-20 17:38:17,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:17,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054834724] [2022-02-20 17:38:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:38:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:17,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #68#return; {33#false} is VALID [2022-02-20 17:38:17,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:38:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:17,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #70#return; {33#false} is VALID [2022-02-20 17:38:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:38:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:17,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #72#return; {33#false} is VALID [2022-02-20 17:38:17,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } 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); {32#true} is VALID [2022-02-20 17:38:17,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {32#true} is VALID [2022-02-20 17:38:17,810 INFO L272 TraceCheckUtils]: 2: Hoare triple {32#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 10 then 1 else 0)); {32#true} is VALID [2022-02-20 17:38:17,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,811 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33#false} {32#true} #68#return; {33#false} is VALID [2022-02-20 17:38:17,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {33#false} is VALID [2022-02-20 17:38:17,811 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#false} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 10 then 1 else 0)); {32#true} is VALID [2022-02-20 17:38:17,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,813 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33#false} {33#false} #70#return; {33#false} is VALID [2022-02-20 17:38:17,813 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {32#true} is VALID [2022-02-20 17:38:17,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-02-20 17:38:17,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-02-20 17:38:17,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume true; {33#false} is VALID [2022-02-20 17:38:17,828 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {33#false} {33#false} #72#return; {33#false} is VALID [2022-02-20 17:38:17,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {33#false} is VALID [2022-02-20 17:38:17,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 17:38:17,828 INFO L272 TraceCheckUtils]: 20: Hoare triple {33#false} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {33#false} is VALID [2022-02-20 17:38:17,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-02-20 17:38:17,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-02-20 17:38:17,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 17:38:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:38:17,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:17,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054834724] [2022-02-20 17:38:17,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054834724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:17,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:17,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:38:17,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469290269] [2022-02-20 17:38:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:38:17,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:17,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:38:17,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:17,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:38:17,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:38:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:17,886 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:38:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:17,973 INFO L93 Difference]: Finished difference Result 55 states and 82 transitions. [2022-02-20 17:38:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:38:17,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:38:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:38:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 17:38:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:38:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2022-02-20 17:38:17,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 82 transitions. [2022-02-20 17:38:18,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:18,106 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:38:18,106 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 17:38:18,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:18,110 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:18,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 17:38:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 17:38:18,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:18,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:18,142 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:18,143 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:18,146 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 17:38:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:38:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:18,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:18,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 25 states. [2022-02-20 17:38:18,147 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 25 states. [2022-02-20 17:38:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:18,163 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 17:38:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:38:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:18,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:18,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:18,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:38:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 17:38:18,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 24 [2022-02-20 17:38:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:18,168 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 17:38:18,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:38:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 17:38:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:38:18,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:18,169 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:18,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:38:18,169 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 324198000, now seen corresponding path program 1 times [2022-02-20 17:38:18,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:18,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905558920] [2022-02-20 17:38:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:18,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:18,187 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:18,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696142933] [2022-02-20 17:38:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:18,190 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-02-20 17:38:18,191 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-02-20 17:38:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:18,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 17:38:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:18,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:18,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} assume { :begin_inline_ULTIMATE.init } 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); {206#true} is VALID [2022-02-20 17:38:18,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {206#true} is VALID [2022-02-20 17:38:18,376 INFO L272 TraceCheckUtils]: 2: Hoare triple {206#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 10 then 1 else 0)); {206#true} is VALID [2022-02-20 17:38:18,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 17:38:18,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 17:38:18,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 17:38:18,377 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {206#true} {206#true} #68#return; {206#true} is VALID [2022-02-20 17:38:18,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {206#true} is VALID [2022-02-20 17:38:18,377 INFO L272 TraceCheckUtils]: 8: Hoare triple {206#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 10 then 1 else 0)); {206#true} is VALID [2022-02-20 17:38:18,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 17:38:18,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 17:38:18,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 17:38:18,378 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {206#true} {206#true} #70#return; {206#true} is VALID [2022-02-20 17:38:18,378 INFO L272 TraceCheckUtils]: 13: Hoare triple {206#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {206#true} is VALID [2022-02-20 17:38:18,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2022-02-20 17:38:18,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2022-02-20 17:38:18,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {206#true} assume true; {206#true} is VALID [2022-02-20 17:38:18,378 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {206#true} {206#true} #72#return; {206#true} is VALID [2022-02-20 17:38:18,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {206#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {265#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:18,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !false; {265#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:18,380 INFO L272 TraceCheckUtils]: 20: Hoare triple {265#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:18,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {272#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:18,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {276#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {207#false} is VALID [2022-02-20 17:38:18,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-02-20 17:38:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:38:18,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:18,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:18,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905558920] [2022-02-20 17:38:18,382 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:18,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696142933] [2022-02-20 17:38:18,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696142933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:18,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:18,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:38:18,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099182535] [2022-02-20 17:38:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:38:18,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:18,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:38:18,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:18,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:38:18,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:38:18,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:38:18,399 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:38:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:18,548 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-02-20 17:38:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:38:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:38:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:38:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:38:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:38:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:38:18,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 17:38:18,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:18,593 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:38:18,593 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 17:38:18,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:38:18,595 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:18,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 85 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 17:38:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-02-20 17:38:18,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:18,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:38:18,600 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:38:18,600 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:38:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:18,602 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 17:38:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 17:38:18,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:18,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:18,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:38:18,604 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-02-20 17:38:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:18,606 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-02-20 17:38:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-02-20 17:38:18,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:18,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:18,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:18,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:38:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-20 17:38:18,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 24 [2022-02-20 17:38:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:18,609 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-20 17:38:18,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:38:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 17:38:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:38:18,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:18,611 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:38:18,638 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-02-20 17:38:18,827 WARN L452 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-02-20 17:38:18,828 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 693549193, now seen corresponding path program 1 times [2022-02-20 17:38:18,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:18,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755049401] [2022-02-20 17:38:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:18,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:18,856 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:18,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535101062] [2022-02-20 17:38:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:18,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:18,858 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-02-20 17:38:18,868 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-02-20 17:38:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:18,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:38:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:18,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:29,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#true} assume { :begin_inline_ULTIMATE.init } 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); {454#true} is VALID [2022-02-20 17:38:29,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {454#true} is VALID [2022-02-20 17:38:29,628 INFO L272 TraceCheckUtils]: 2: Hoare triple {454#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 10 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:29,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#true} ~cond := #in~cond; {454#true} is VALID [2022-02-20 17:38:29,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#true} assume !(0 == ~cond); {454#true} is VALID [2022-02-20 17:38:29,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#true} assume true; {454#true} is VALID [2022-02-20 17:38:29,629 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {454#true} {454#true} #68#return; {454#true} is VALID [2022-02-20 17:38:29,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {454#true} is VALID [2022-02-20 17:38:29,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {454#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 10 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:29,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#true} ~cond := #in~cond; {454#true} is VALID [2022-02-20 17:38:29,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#true} assume !(0 == ~cond); {454#true} is VALID [2022-02-20 17:38:29,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#true} assume true; {454#true} is VALID [2022-02-20 17:38:29,630 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {454#true} {454#true} #70#return; {454#true} is VALID [2022-02-20 17:38:29,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {454#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:29,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#true} ~cond := #in~cond; {501#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:38:29,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {501#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {505#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:29,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {505#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {505#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:29,636 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {505#(not (= |assume_abort_if_not_#in~cond| 0))} {454#true} #72#return; {512#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:38:29,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {512#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {516#(and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:29,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {516#(and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} assume !false; {516#(and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:29,637 INFO L272 TraceCheckUtils]: 20: Hoare triple {516#(and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:29,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {454#true} ~cond := #in~cond; {526#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:29,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {526#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {530#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:29,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {530#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {530#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:31,649 WARN L284 TraceCheckUtils]: 24: Hoare quadruple {530#(not (= |__VERIFIER_assert_#in~cond| 0))} {516#(and (<= 1 |ULTIMATE.start_main_~p~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} #74#return; {537#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (and (<= 1 (div (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) 0)) (and (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (= |ULTIMATE.start_main_~a~0#1| 0))))} is UNKNOWN [2022-02-20 17:38:31,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {537#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (and (<= 1 (div (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|))) (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) 0)) (and (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (= |ULTIMATE.start_main_~a~0#1| 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {541#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:38:31,652 INFO L272 TraceCheckUtils]: 26: Hoare triple {541#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:31,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:31,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {455#false} is VALID [2022-02-20 17:38:31,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {455#false} assume !false; {455#false} is VALID [2022-02-20 17:38:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:38:31,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:38:46,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {455#false} assume !false; {455#false} is VALID [2022-02-20 17:38:46,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {549#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {455#false} is VALID [2022-02-20 17:38:46,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {545#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {549#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:46,183 INFO L272 TraceCheckUtils]: 26: Hoare triple {565#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {545#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:46,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {565#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:38:46,185 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {530#(not (= |__VERIFIER_assert_#in~cond| 0))} {454#true} #74#return; {569#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} is VALID [2022-02-20 17:38:46,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {530#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {530#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:46,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {582#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {530#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:46,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {454#true} ~cond := #in~cond; {582#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:38:46,187 INFO L272 TraceCheckUtils]: 20: Hoare triple {454#true} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:46,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {454#true} assume !false; {454#true} is VALID [2022-02-20 17:38:46,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {454#true} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {454#true} is VALID [2022-02-20 17:38:46,190 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {454#true} {454#true} #72#return; {454#true} is VALID [2022-02-20 17:38:46,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {454#true} assume true; {454#true} is VALID [2022-02-20 17:38:46,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#true} assume !(0 == ~cond); {454#true} is VALID [2022-02-20 17:38:46,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#true} ~cond := #in~cond; {454#true} is VALID [2022-02-20 17:38:46,190 INFO L272 TraceCheckUtils]: 13: Hoare triple {454#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:46,190 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {454#true} {454#true} #70#return; {454#true} is VALID [2022-02-20 17:38:46,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#true} assume true; {454#true} is VALID [2022-02-20 17:38:46,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#true} assume !(0 == ~cond); {454#true} is VALID [2022-02-20 17:38:46,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#true} ~cond := #in~cond; {454#true} is VALID [2022-02-20 17:38:46,191 INFO L272 TraceCheckUtils]: 8: Hoare triple {454#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 10 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:46,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {454#true} is VALID [2022-02-20 17:38:46,191 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {454#true} {454#true} #68#return; {454#true} is VALID [2022-02-20 17:38:46,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#true} assume true; {454#true} is VALID [2022-02-20 17:38:46,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#true} assume !(0 == ~cond); {454#true} is VALID [2022-02-20 17:38:46,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#true} ~cond := #in~cond; {454#true} is VALID [2022-02-20 17:38:46,193 INFO L272 TraceCheckUtils]: 2: Hoare triple {454#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 10 then 1 else 0)); {454#true} is VALID [2022-02-20 17:38:46,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {454#true} is VALID [2022-02-20 17:38:46,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#true} assume { :begin_inline_ULTIMATE.init } 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); {454#true} is VALID [2022-02-20 17:38:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:38:46,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:46,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755049401] [2022-02-20 17:38:46,202 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:46,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535101062] [2022-02-20 17:38:46,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535101062] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:38:46,202 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:38:46,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-02-20 17:38:46,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89819256] [2022-02-20 17:38:46,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:38:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:38:46,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:46,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:38:48,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:48,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:38:48,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:38:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:38:48,269 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:38:50,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:50,197 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-02-20 17:38:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 17:38:50,197 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:38:50,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:38:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-02-20 17:38:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:38:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-02-20 17:38:50,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2022-02-20 17:38:52,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:52,254 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:38:52,254 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 17:38:52,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:38:52,255 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:52,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 106 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 17:38:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 17:38:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-02-20 17:38:52,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:52,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:38:52,275 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:38:52,275 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:38:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:52,281 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-02-20 17:38:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-02-20 17:38:52,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:52,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:52,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-02-20 17:38:52,282 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-02-20 17:38:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:52,290 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-02-20 17:38:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-02-20 17:38:52,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:52,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:52,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:52,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:38:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-02-20 17:38:52,294 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 30 [2022-02-20 17:38:52,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:52,294 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-02-20 17:38:52,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:38:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-02-20 17:38:52,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:38:52,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:52,305 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:38:52,321 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-02-20 17:38:52,510 WARN L452 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-02-20 17:38:52,510 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:52,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1087866724, now seen corresponding path program 1 times [2022-02-20 17:38:52,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:52,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997450479] [2022-02-20 17:38:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:52,537 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:52,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [17415414] [2022-02-20 17:38:52,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:52,539 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-02-20 17:38:52,556 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-02-20 17:38:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:52,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:38:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:52,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:55,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {866#true} assume { :begin_inline_ULTIMATE.init } 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); {866#true} is VALID [2022-02-20 17:38:55,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {866#true} is VALID [2022-02-20 17:38:55,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {866#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 10 then 1 else 0)); {866#true} is VALID [2022-02-20 17:38:55,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {866#true} ~cond := #in~cond; {880#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:38:55,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {880#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {884#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:55,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {884#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:55,187 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {884#(not (= |assume_abort_if_not_#in~cond| 0))} {866#true} #68#return; {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-20 17:38:55,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-20 17:38:55,188 INFO L272 TraceCheckUtils]: 8: Hoare triple {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 10 then 1 else 0)); {866#true} is VALID [2022-02-20 17:38:55,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-02-20 17:38:55,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-02-20 17:38:55,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#true} assume true; {866#true} is VALID [2022-02-20 17:38:55,189 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {866#true} {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} #70#return; {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-20 17:38:55,189 INFO L272 TraceCheckUtils]: 13: Hoare triple {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {866#true} is VALID [2022-02-20 17:38:55,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} ~cond := #in~cond; {880#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:38:55,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {880#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {884#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:55,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {884#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:38:55,190 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {884#(not (= |assume_abort_if_not_#in~cond| 0))} {891#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} #72#return; {925#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-20 17:38:55,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {925#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10))} main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:55,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !false; {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:55,191 INFO L272 TraceCheckUtils]: 20: Hoare triple {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {866#true} is VALID [2022-02-20 17:38:55,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-02-20 17:38:55,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-02-20 17:38:55,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#true} assume true; {866#true} is VALID [2022-02-20 17:38:55,195 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {866#true} {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #74#return; {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:55,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~a~0#1 && 0 != main_~b~0#1); {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:55,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 0 == (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then main_~a~0#1 % 2 - 2 else main_~a~0#1 % 2) && 0 == (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then main_~b~0#1 % 2 - 2 else main_~b~0#1 % 2);main_~a~0#1 := (if main_~a~0#1 < 0 && 0 != main_~a~0#1 % 2 then 1 + main_~a~0#1 / 2 else main_~a~0#1 / 2);main_~b~0#1 := (if main_~b~0#1 < 0 && 0 != main_~b~0#1 % 2 then 1 + main_~b~0#1 / 2 else main_~b~0#1 / 2);main_~p~0#1 := 4 * main_~p~0#1; {954#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} is VALID [2022-02-20 17:38:55,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {954#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} assume !false; {954#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} is VALID [2022-02-20 17:38:55,199 INFO L272 TraceCheckUtils]: 28: Hoare triple {954#(and (= |ULTIMATE.start_main_~p~0#1| 4) (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (div |ULTIMATE.start_main_~x~0#1| 2) |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~b~0#1| (div |ULTIMATE.start_main_~y~0#1| 2)) (<= |ULTIMATE.start_main_~x~0#1| 10) (= |ULTIMATE.start_main_~q~0#1| 0) (<= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (<= (mod |ULTIMATE.start_main_~x~0#1| 2) 0))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:55,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:55,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-02-20 17:38:55,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-02-20 17:38:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:38:55,201 INFO L328 TraceCheckSpWp]: Computing backward predicates...