./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound50.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/ps3-ll_unwindbound50.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 eebd89172d2922b25518196d7199bdc2b40bcf663d7c245ca245657f0105901c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:41:02,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:41:02,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:41:02,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:41:02,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:41:02,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:41:02,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:41:02,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:41:02,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:41:02,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:41:02,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:41:02,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:41:02,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:41:02,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:41:02,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:41:02,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:41:02,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:41:02,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:41:02,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:41:02,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:41:02,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:41:02,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:41:02,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:41:02,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:41:02,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:41:02,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:41:02,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:41:02,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:41:02,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:41:02,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:41:02,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:41:02,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:41:02,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:41:02,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:41:02,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:41:02,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:41:02,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:41:02,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:41:02,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:41:02,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:41:02,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:41:02,519 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:41:02,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:41:02,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:41:02,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:41:02,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:41:02,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:41:02,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:41:02,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:41:02,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:41:02,553 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:41:02,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:41:02,554 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:41:02,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:41:02,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:41:02,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:41:02,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:41:02,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:41:02,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:41:02,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:41:02,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:41:02,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:02,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:41:02,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:41:02,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:41:02,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:41:02,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:41:02,557 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:41:02,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:41:02,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:41:02,558 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 -> eebd89172d2922b25518196d7199bdc2b40bcf663d7c245ca245657f0105901c [2022-02-20 17:41:02,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:41:02,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:41:02,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:41:02,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:41:02,751 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:41:02,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound50.c [2022-02-20 17:41:02,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84aac3f28/05192af9f69e4c11b78931dced74953e/FLAG256095f63 [2022-02-20 17:41:03,140 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:41:03,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps3-ll_unwindbound50.c [2022-02-20 17:41:03,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84aac3f28/05192af9f69e4c11b78931dced74953e/FLAG256095f63 [2022-02-20 17:41:03,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84aac3f28/05192af9f69e4c11b78931dced74953e [2022-02-20 17:41:03,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:41:03,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:41:03,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:03,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:41:03,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:41:03,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3397d5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03, skipping insertion in model container [2022-02-20 17:41:03,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:41:03,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:41:03,717 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/ps3-ll_unwindbound50.c[458,471] [2022-02-20 17:41:03,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:03,754 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:41:03,774 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/ps3-ll_unwindbound50.c[458,471] [2022-02-20 17:41:03,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:41:03,804 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:41:03,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03 WrapperNode [2022-02-20 17:41:03,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:41:03,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:03,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:41:03,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:41:03,813 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:41:03" (1/1) ... [2022-02-20 17:41:03,819 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:41:03" (1/1) ... [2022-02-20 17:41:03,839 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:41:03,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:41:03,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:41:03,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:41:03,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:41:03,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:41:03,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:41:03,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:41:03,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:41:03,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (1/1) ... [2022-02-20 17:41:03,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:41:03,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:03,908 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:41:03,922 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:41:03,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:41:03,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:41:03,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:41:03,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:41:03,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:41:03,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:41:03,984 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:41:03,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:41:04,085 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:41:04,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:41:04,091 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:41:04,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:04 BoogieIcfgContainer [2022-02-20 17:41:04,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:41:04,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:41:04,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:41:04,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:41:04,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:41:03" (1/3) ... [2022-02-20 17:41:04,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ef00ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:04, skipping insertion in model container [2022-02-20 17:41:04,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:41:03" (2/3) ... [2022-02-20 17:41:04,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ef00ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:41:04, skipping insertion in model container [2022-02-20 17:41:04,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:04" (3/3) ... [2022-02-20 17:41:04,100 INFO L111 eAbstractionObserver]: Analyzing ICFG ps3-ll_unwindbound50.c [2022-02-20 17:41:04,104 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:41:04,105 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:41:04,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:41:04,195 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:41:04,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:41:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:04,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:41:04,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:04,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:04,215 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:04,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:41:04,227 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:04,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498138180] [2022-02-20 17:41:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:04,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20#true} is VALID [2022-02-20 17:41:04,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {20#true} is VALID [2022-02-20 17:41:04,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:41:04,394 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {21#false} is VALID [2022-02-20 17:41:04,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:41:04,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:41:04,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:41:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:04,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:04,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498138180] [2022-02-20 17:41:04,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498138180] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:04,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:04,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:41:04,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221695769] [2022-02-20 17:41:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:04,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:41:04,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:04,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:04,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:41:04,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:41:04,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:41:04,467 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,522 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:41:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:41:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:41:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:41:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:41:04,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:41:04,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:04,611 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:41:04,612 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:41:04,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:41:04,618 INFO L933 BasicCegarLoop]: 19 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, 19 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:41:04,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:41:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:41:04,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:04,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,650 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,657 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:41:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:41:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:04,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:41:04,659 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:41:04,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,663 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:41:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:41:04,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:04,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:04,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:04,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:41:04,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:41:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:04,673 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:41:04,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:41:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:04,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:04,675 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:04,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:41:04,676 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:41:04,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:04,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823973735] [2022-02-20 17:41:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:04,709 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:04,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1971686880] [2022-02-20 17:41:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:04,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:04,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:04,719 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:41:04,724 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:41:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:04,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:41:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:04,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:04,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {114#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:04,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {114#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:04,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {121#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:41:04,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {110#false} is VALID [2022-02-20 17:41:04,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#false} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {110#false} is VALID [2022-02-20 17:41:04,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2022-02-20 17:41:04,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2022-02-20 17:41:04,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:41:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:04,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:04,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:04,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823973735] [2022-02-20 17:41:04,876 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:04,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971686880] [2022-02-20 17:41:04,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971686880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:04,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:04,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:41:04,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073022818] [2022-02-20 17:41:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:04,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:04,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:04,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:04,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:41:04,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:04,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:41:04,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:04,899 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,939 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:41:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:41:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:41:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:41:04,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:41:04,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:04,984 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:41:04,985 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:41:04,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:41:04,986 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:04,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:41:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:41:04,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:04,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,994 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,994 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,995 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:04,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:04,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:04,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:41:04,997 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:41:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:04,999 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:41:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:05,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:05,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:05,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:05,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:41:05,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:41:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:05,003 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:41:05,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:41:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:41:05,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:05,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:05,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:41:05,222 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:41:05,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:41:05,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:05,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342042990] [2022-02-20 17:41:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:05,236 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:05,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103617734] [2022-02-20 17:41:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:05,243 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:41:05,246 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:41:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:05,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:41:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:05,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:05,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {215#true} is VALID [2022-02-20 17:41:05,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {215#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:05,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:05,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:05,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:05,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:05,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {216#false} is VALID [2022-02-20 17:41:05,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:41:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:05,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:41:05,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:05,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342042990] [2022-02-20 17:41:05,385 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:05,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103617734] [2022-02-20 17:41:05,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103617734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:41:05,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:41:05,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:41:05,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656004922] [2022-02-20 17:41:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:05,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:05,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:05,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:05,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:41:05,396 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:05,464 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:41:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:41:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:41:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:41:05,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-02-20 17:41:05,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:05,492 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:41:05,492 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:41:05,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:41:05,493 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:05,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:41:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:41:05,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:05,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:05,498 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:05,499 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:05,500 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:41:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:41:05,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:05,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:05,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:41:05,501 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:41:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:05,503 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:41:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:41:05,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:05,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:05,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:05,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:41:05,505 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2022-02-20 17:41:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:05,505 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:41:05,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:41:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:05,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:05,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:05,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:41:05,729 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:41:05,729 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:05,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-02-20 17:41:05,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:05,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734634775] [2022-02-20 17:41:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:05,742 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:05,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2065465053] [2022-02-20 17:41:05,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:05,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:05,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:05,750 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:41:05,752 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:41:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:05,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:41:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:05,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:05,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:05,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {352#(<= ~counter~0 0)} is VALID [2022-02-20 17:41:05,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#(<= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {359#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {359#(<= ~counter~0 1)} ~cond := #in~cond; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {359#(<= ~counter~0 1)} assume !(0 == ~cond); {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= ~counter~0 1)} assume true; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,941 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {359#(<= ~counter~0 1)} {359#(<= ~counter~0 1)} #39#return; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {359#(<= ~counter~0 1)} is VALID [2022-02-20 17:41:05,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#(<= ~counter~0 1)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {384#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-20 17:41:05,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {348#false} is VALID [2022-02-20 17:41:05,943 INFO L272 TraceCheckUtils]: 12: Hoare triple {348#false} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {348#false} is VALID [2022-02-20 17:41:05,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-02-20 17:41:05,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:41:05,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:41:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:05,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:06,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-02-20 17:41:06,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-02-20 17:41:06,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-02-20 17:41:06,081 INFO L272 TraceCheckUtils]: 12: Hoare triple {348#false} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {348#false} is VALID [2022-02-20 17:41:06,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {412#(< |ULTIMATE.start_main_#t~post5#1| 50)} assume !(main_#t~post5#1 < 50);havoc main_#t~post5#1; {348#false} is VALID [2022-02-20 17:41:06,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {416#(< ~counter~0 50)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {412#(< |ULTIMATE.start_main_#t~post5#1| 50)} is VALID [2022-02-20 17:41:06,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#(< ~counter~0 50)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {416#(< ~counter~0 50)} is VALID [2022-02-20 17:41:06,083 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {347#true} {416#(< ~counter~0 50)} #39#return; {416#(< ~counter~0 50)} is VALID [2022-02-20 17:41:06,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#true} assume true; {347#true} is VALID [2022-02-20 17:41:06,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {347#true} assume !(0 == ~cond); {347#true} is VALID [2022-02-20 17:41:06,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} ~cond := #in~cond; {347#true} is VALID [2022-02-20 17:41:06,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {347#true} is VALID [2022-02-20 17:41:06,085 INFO L290 TraceCheckUtils]: 3: Hoare triple {416#(< ~counter~0 50)} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {416#(< ~counter~0 50)} is VALID [2022-02-20 17:41:06,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {441#(< ~counter~0 49)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {416#(< ~counter~0 50)} is VALID [2022-02-20 17:41:06,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(< ~counter~0 49)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {441#(< ~counter~0 49)} is VALID [2022-02-20 17:41:06,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {347#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {441#(< ~counter~0 49)} is VALID [2022-02-20 17:41:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:06,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:06,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734634775] [2022-02-20 17:41:06,087 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:06,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065465053] [2022-02-20 17:41:06,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065465053] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:06,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:06,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:41:06,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16139971] [2022-02-20 17:41:06,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:06,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:41:06,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:06,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:06,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:06,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:41:06,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:41:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:06,113 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:06,277 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:41:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:41:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:41:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 17:41:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 17:41:06,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2022-02-20 17:41:06,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:06,335 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:41:06,335 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:41:06,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:41:06,336 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:06,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:41:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-02-20 17:41:06,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:06,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:06,349 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:06,349 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:06,351 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:41:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:41:06,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:06,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:06,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:41:06,353 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:41:06,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:06,354 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:41:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:41:06,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:06,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:06,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:06,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:41:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-02-20 17:41:06,357 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 16 [2022-02-20 17:41:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:06,357 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-02-20 17:41:06,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:41:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 17:41:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:41:06,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:41:06,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:41:06,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:06,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:06,576 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:41:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:41:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-02-20 17:41:06,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:41:06,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115989263] [2022-02-20 17:41:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:06,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:41:06,586 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:41:06,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901328457] [2022-02-20 17:41:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:41:06,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:41:06,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:41:06,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:41:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:06,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:41:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:41:06,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:41:06,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-02-20 17:41:06,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:06,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:06,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:06,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {670#true} is VALID [2022-02-20 17:41:06,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:41:06,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:41:06,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:41:06,788 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {670#true} {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} #39#return; {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-20 17:41:06,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(and (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:06,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:06,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:41:06,791 INFO L272 TraceCheckUtils]: 12: Hoare triple {703#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:06,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:06,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-02-20 17:41:06,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-02-20 17:41:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:41:06,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:06,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-02-20 17:41:06,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {717#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {671#false} is VALID [2022-02-20 17:41:06,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {717#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:06,980 INFO L272 TraceCheckUtils]: 12: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {713#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:06,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:06,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~y~0#1 := 1 + main_~y~0#1;main_~x~0#1 := main_~y~0#1 * main_~y~0#1 + main_~x~0#1; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,103 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {670#true} {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} #39#return; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {670#true} assume true; {670#true} is VALID [2022-02-20 17:41:07,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} assume !(0 == ~cond); {670#true} is VALID [2022-02-20 17:41:07,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} ~cond := #in~cond; {670#true} is VALID [2022-02-20 17:41:07,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 6 * main_~x~0#1 - 2 * main_~y~0#1 * main_~y~0#1 * main_~y~0#1 - 3 * main_~y~0#1 * main_~y~0#1 - main_~y~0#1 then 1 else 0)); {670#true} is VALID [2022-02-20 17:41:07,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} assume !!(main_#t~post5#1 < 50);havoc main_#t~post5#1; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~k~0#1, main_~y~0#1, main_~x~0#1, main_~c~0#1;havoc main_~k~0#1;havoc main_~y~0#1;havoc main_~x~0#1;havoc main_~c~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;main_~k~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := 0;main_~x~0#1 := 0;main_~c~0#1 := 0; {733#(= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:41:07,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {670#true} is VALID [2022-02-20 17:41:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 17:41:07,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:07,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115989263] [2022-02-20 17:41:07,107 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:07,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901328457] [2022-02-20 17:41:07,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901328457] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:41:07,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:41:07,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-02-20 17:41:07,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318939638] [2022-02-20 17:41:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:41:07,108 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:07,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:07,108 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:07,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:07,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:41:07,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:41:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:41:07,144 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:07,215 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 17:41:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:41:07,215 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:41:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:41:07,215 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 17:41:07,216 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-20 17:41:07,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2022-02-20 17:41:07,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:07,253 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:41:07,253 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:41:07,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:41:07,255 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:41:07,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:41:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:41:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:41:07,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:41:07,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:07,256 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:07,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:07,256 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:41:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:07,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:07,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:07,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:41:07,257 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:41:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:41:07,257 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:41:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:07,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:41:07,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:41:07,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:41:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:41:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:41:07,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 17:41:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:41:07,258 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:41:07,259 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:41:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:41:07,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:41:07,261 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:41:07,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:41:07,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:41:07,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:41:07,528 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:41:07,528 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 27 36) no Hoare annotation was computed. [2022-02-20 17:41:07,529 INFO L854 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|)) [2022-02-20 17:41:07,529 INFO L854 garLoopResultBuilder]: At program point L27-4(lines 27 36) the Hoare annotation is: (= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|)) [2022-02-20 17:41:07,529 INFO L861 garLoopResultBuilder]: At program point L38(lines 18 39) the Hoare annotation is: true [2022-02-20 17:41:07,529 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:41:07,529 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:41:07,529 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:41:07,529 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (= (* 6 |ULTIMATE.start_main_~x~0#1|) (+ (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~y~0#1|)) [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-02-20 17:41:07,530 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:41:07,530 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2022-02-20 17:41:07,531 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 17:41:07,533 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:41:07,534 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:41:07,537 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:41:07,538 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:07,538 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:41:07,538 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:07,538 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:41:07,539 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:41:07,539 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:41:07,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:41:07 BoogieIcfgContainer [2022-02-20 17:41:07,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:41:07,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:41:07,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:41:07,547 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:41:07,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:41:04" (3/4) ... [2022-02-20 17:41:07,549 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:41:07,553 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:41:07,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:41:07,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:41:07,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:41:07,556 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:41:07,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:41:07,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:41:07,580 INFO L158 Benchmark]: Toolchain (without parser) took 3997.43ms. Allocated memory is still 107.0MB. Free memory was 76.8MB in the beginning and 47.1MB in the end (delta: 29.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,580 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:07,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 107.0MB. Free memory was 76.6MB in the beginning and 66.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.05ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 64.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,581 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 107.0MB. Free memory was 64.5MB in the beginning and 63.6MB in the end (delta: 890.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:41:07,581 INFO L158 Benchmark]: RCFGBuilder took 216.50ms. Allocated memory is still 107.0MB. Free memory was 63.6MB in the beginning and 53.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,582 INFO L158 Benchmark]: TraceAbstraction took 3452.16ms. Allocated memory is still 107.0MB. Free memory was 52.8MB in the beginning and 49.8MB in the end (delta: 2.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,582 INFO L158 Benchmark]: Witness Printer took 32.95ms. Allocated memory is still 107.0MB. Free memory was 49.8MB in the beginning and 47.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:41:07,584 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 81.8MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.25ms. Allocated memory is still 107.0MB. Free memory was 76.6MB in the beginning and 66.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.05ms. Allocated memory is still 107.0MB. Free memory was 66.1MB in the beginning and 64.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 107.0MB. Free memory was 64.5MB in the beginning and 63.6MB in the end (delta: 890.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 216.50ms. Allocated memory is still 107.0MB. Free memory was 63.6MB in the beginning and 53.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3452.16ms. Allocated memory is still 107.0MB. Free memory was 52.8MB in the beginning and 49.8MB in the end (delta: 2.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 32.95ms. Allocated memory is still 107.0MB. Free memory was 49.8MB in the beginning and 47.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 69 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 16 PreInvPairs, 30 NumberOfFragments, 53 HoareAnnotationTreeSize, 16 FomulaSimplifications, 203 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 3 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 11/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 6 * x == 3 * (y * y) + y * y * y * 2 + y - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:41:07,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE