./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound50.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/geo1-ll_valuebound50.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 7533b3d7f0eee80e44aab8f7ead88d0e8fea1ae56bf86b66a98a6784801a4e45 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:28:47,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:28:47,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:28:47,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:28:47,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:28:47,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:28:47,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:28:47,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:28:47,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:28:47,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:28:47,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:28:47,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:28:47,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:28:47,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:28:47,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:28:47,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:28:47,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:28:47,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:28:47,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:28:47,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:28:47,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:28:47,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:28:47,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:28:47,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:28:47,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:28:47,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:28:47,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:28:47,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:28:47,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:28:47,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:28:47,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:28:47,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:28:47,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:28:47,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:28:47,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:28:47,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:28:47,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:28:47,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:28:47,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:28:47,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:28:47,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:28:47,667 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:28:47,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:28:47,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:28:47,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:28:47,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:28:47,690 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:28:47,691 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:28:47,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:28:47,691 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:28:47,691 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:28:47,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:28:47,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:28:47,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:28:47,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:28:47,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:28:47,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:28:47,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:28:47,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:28:47,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:47,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:28:47,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:28:47,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:28:47,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:28:47,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:28:47,695 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:28:47,695 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:28:47,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:28:47,695 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 -> 7533b3d7f0eee80e44aab8f7ead88d0e8fea1ae56bf86b66a98a6784801a4e45 [2022-02-20 17:28:47,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:28:47,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:28:47,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:28:47,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:28:47,885 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:28:47,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound50.c [2022-02-20 17:28:47,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae919aa1/16c102e37b214bbd8558fb1d97d744c8/FLAGd1980cfb4 [2022-02-20 17:28:48,313 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:28:48,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_valuebound50.c [2022-02-20 17:28:48,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae919aa1/16c102e37b214bbd8558fb1d97d744c8/FLAGd1980cfb4 [2022-02-20 17:28:48,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae919aa1/16c102e37b214bbd8558fb1d97d744c8 [2022-02-20 17:28:48,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:28:48,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:28:48,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:48,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:28:48,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:28:48,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0ae587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48, skipping insertion in model container [2022-02-20 17:28:48,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:28:48,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:28:48,512 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/geo1-ll_valuebound50.c[546,559] [2022-02-20 17:28:48,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:48,527 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:28:48,535 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/geo1-ll_valuebound50.c[546,559] [2022-02-20 17:28:48,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:48,547 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:28:48,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48 WrapperNode [2022-02-20 17:28:48,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:48,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:48,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:28:48,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:28:48,553 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:28:48" (1/1) ... [2022-02-20 17:28:48,557 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:28:48" (1/1) ... [2022-02-20 17:28:48,569 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 17:28:48,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:48,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:28:48,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:28:48,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:28:48,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:28:48,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:28:48,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:28:48,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:28:48,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (1/1) ... [2022-02-20 17:28:48,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:48,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:48,612 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:28:48,624 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:28:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:28:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:28:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:28:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:28:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:28:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:28:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:28:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:28:48,683 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:28:48,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:28:48,786 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:28:48,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:28:48,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:28:48,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:48 BoogieIcfgContainer [2022-02-20 17:28:48,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:28:48,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:28:48,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:28:48,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:28:48,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:28:48" (1/3) ... [2022-02-20 17:28:48,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e124ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:48, skipping insertion in model container [2022-02-20 17:28:48,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:48" (2/3) ... [2022-02-20 17:28:48,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e124ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:48, skipping insertion in model container [2022-02-20 17:28:48,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:48" (3/3) ... [2022-02-20 17:28:48,797 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_valuebound50.c [2022-02-20 17:28:48,801 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:28:48,801 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:28:48,827 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:28:48,832 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:28:48,832 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:28:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:28:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:28:48,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:48,848 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:48,848 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash -439363615, now seen corresponding path program 1 times [2022-02-20 17:28:48,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:48,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506625493] [2022-02-20 17:28:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:48,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:28:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:48,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:48,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:48,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:48,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #53#return; {31#false} is VALID [2022-02-20 17:28:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:28:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #55#return; {31#false} is VALID [2022-02-20 17:28:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:28:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #57#return; {31#false} is VALID [2022-02-20 17:28:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:28:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #59#return; {31#false} is VALID [2022-02-20 17:28:49,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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(10, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 17:28:49,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {30#true} is VALID [2022-02-20 17:28:49,020 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 50 then 1 else 0)); {30#true} is VALID [2022-02-20 17:28:49,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,021 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#false} {30#true} #53#return; {31#false} is VALID [2022-02-20 17:28:49,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {31#false} is VALID [2022-02-20 17:28:49,022 INFO L272 TraceCheckUtils]: 8: Hoare triple {31#false} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 50 then 1 else 0)); {30#true} is VALID [2022-02-20 17:28:49,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,023 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {31#false} {31#false} #55#return; {31#false} is VALID [2022-02-20 17:28:49,023 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:28:49,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,024 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31#false} {31#false} #57#return; {31#false} is VALID [2022-02-20 17:28:49,025 INFO L272 TraceCheckUtils]: 18: Hoare triple {31#false} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:28:49,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:28:49,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:28:49,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:28:49,026 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {31#false} {31#false} #59#return; {31#false} is VALID [2022-02-20 17:28:49,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {31#false} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {31#false} is VALID [2022-02-20 17:28:49,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:28:49,027 INFO L272 TraceCheckUtils]: 25: Hoare triple {31#false} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {31#false} is VALID [2022-02-20 17:28:49,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:28:49,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:28:49,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:28:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:28:49,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:49,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506625493] [2022-02-20 17:28:49,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506625493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:49,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:49,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:28:49,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761789057] [2022-02-20 17:28:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:28:49,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:49,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:28:49,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:49,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:28:49,059 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:28:49,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:28:49,074 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:28:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,109 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 17:28:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:28:49,110 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:28:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:28:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 17:28:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:28:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 17:28:49,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 17:28:49,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:49,193 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:28:49,193 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:28:49,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:28:49,198 INFO L933 BasicCegarLoop]: 31 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, 31 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:28:49,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:28:49,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:28:49,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:49,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:28:49,219 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:28:49,219 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:28:49,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,222 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:28:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:28:49,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:49,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:49,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:28:49,223 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-02-20 17:28:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,225 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:28:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:28:49,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:49,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:49,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:49,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:28:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:28:49,229 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-02-20 17:28:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:49,230 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:28:49,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:28:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:28:49,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:28:49,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:49,231 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:49,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:28:49,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1976149669, now seen corresponding path program 1 times [2022-02-20 17:28:49,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:49,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700689748] [2022-02-20 17:28:49,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:49,254 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:49,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798377480] [2022-02-20 17:28:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:49,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:49,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:49,256 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:28:49,257 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:28:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:28:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:49,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#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(10, 2);call #Ultimate.allocInit(12, 3); {198#true} is VALID [2022-02-20 17:28:49,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {198#true} is VALID [2022-02-20 17:28:49,475 INFO L272 TraceCheckUtils]: 2: Hoare triple {198#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 50 then 1 else 0)); {198#true} is VALID [2022-02-20 17:28:49,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:28:49,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:28:49,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:28:49,476 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {198#true} {198#true} #53#return; {198#true} is VALID [2022-02-20 17:28:49,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {198#true} is VALID [2022-02-20 17:28:49,476 INFO L272 TraceCheckUtils]: 8: Hoare triple {198#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 50 then 1 else 0)); {198#true} is VALID [2022-02-20 17:28:49,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:28:49,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:28:49,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:28:49,477 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {198#true} {198#true} #55#return; {198#true} is VALID [2022-02-20 17:28:49,477 INFO L272 TraceCheckUtils]: 13: Hoare triple {198#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {198#true} is VALID [2022-02-20 17:28:49,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:28:49,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:28:49,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:28:49,478 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {198#true} {198#true} #57#return; {198#true} is VALID [2022-02-20 17:28:49,478 INFO L272 TraceCheckUtils]: 18: Hoare triple {198#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {198#true} is VALID [2022-02-20 17:28:49,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#true} ~cond := #in~cond; {198#true} is VALID [2022-02-20 17:28:49,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {198#true} assume !(0 == ~cond); {198#true} is VALID [2022-02-20 17:28:49,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {198#true} assume true; {198#true} is VALID [2022-02-20 17:28:49,479 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {198#true} {198#true} #59#return; {198#true} is VALID [2022-02-20 17:28:49,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {198#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {272#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:49,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {272#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} assume !false; {272#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:49,481 INFO L272 TraceCheckUtils]: 25: Hoare triple {272#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:49,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:49,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {199#false} is VALID [2022-02-20 17:28:49,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 17:28:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:28:49,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:49,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:49,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700689748] [2022-02-20 17:28:49,483 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:49,483 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798377480] [2022-02-20 17:28:49,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798377480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:49,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:49,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:28:49,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056228367] [2022-02-20 17:28:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:28:49,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:49,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:28:49,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:49,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:28:49,501 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:28:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:28:49,502 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:28:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,586 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 17:28:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:28:49,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-02-20 17:28:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:28:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 17:28:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:28:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 17:28:49,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 17:28:49,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:49,618 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:28:49,618 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:28:49,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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:28:49,619 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:49,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 88 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:28:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-02-20 17:28:49,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:49,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:28:49,624 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:28:49,624 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:28:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,626 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:28:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-20 17:28:49,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:49,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:49,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-02-20 17:28:49,628 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-02-20 17:28:49,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:49,629 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:28:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-20 17:28:49,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:49,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:49,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:49,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:28:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 17:28:49,632 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 29 [2022-02-20 17:28:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:49,632 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 17:28:49,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:28:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 17:28:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:28:49,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:49,634 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:49,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:49,847 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:28:49,847 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -900153941, now seen corresponding path program 1 times [2022-02-20 17:28:49,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:49,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568044102] [2022-02-20 17:28:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:49,864 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:49,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134919949] [2022-02-20 17:28:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:49,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:49,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:49,866 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:28:49,867 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:28:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:28:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:49,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:52,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {439#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(10, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-02-20 17:28:52,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {439#true} is VALID [2022-02-20 17:28:52,175 INFO L272 TraceCheckUtils]: 2: Hoare triple {439#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 50 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:52,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:52,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:52,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:52,176 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {439#true} {439#true} #53#return; {439#true} is VALID [2022-02-20 17:28:52,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {439#true} is VALID [2022-02-20 17:28:52,176 INFO L272 TraceCheckUtils]: 8: Hoare triple {439#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 50 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:52,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:52,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:52,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:52,177 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {439#true} {439#true} #55#return; {439#true} is VALID [2022-02-20 17:28:52,177 INFO L272 TraceCheckUtils]: 13: Hoare triple {439#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:52,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:52,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:52,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:52,183 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {439#true} {439#true} #57#return; {439#true} is VALID [2022-02-20 17:28:52,183 INFO L272 TraceCheckUtils]: 18: Hoare triple {439#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:52,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:52,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:52,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:52,183 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {439#true} {439#true} #59#return; {439#true} is VALID [2022-02-20 17:28:52,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {439#true} is VALID [2022-02-20 17:28:52,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {439#true} assume !false; {439#true} is VALID [2022-02-20 17:28:52,184 INFO L272 TraceCheckUtils]: 25: Hoare triple {439#true} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:52,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {439#true} ~cond := #in~cond; {522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:52,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {522#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:52,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:52,186 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {526#(not (= |__VERIFIER_assert_#in~cond| 0))} {439#true} #61#return; {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:52,187 INFO L290 TraceCheckUtils]: 30: Hoare triple {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~c~0#1 < main_~k~0#1); {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:52,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {540#(exists ((|v_ULTIMATE.start_main_~x~0#1_12| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (= |ULTIMATE.start_main_~x~0#1| (* |v_ULTIMATE.start_main_~x~0#1_12| (+ (- 1) |ULTIMATE.start_main_~z~0#1|))) (= (+ |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~y~0#1|) (+ (* |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~z~0#1|) 1))))} is VALID [2022-02-20 17:28:52,189 INFO L272 TraceCheckUtils]: 32: Hoare triple {540#(exists ((|v_ULTIMATE.start_main_~x~0#1_12| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (= |ULTIMATE.start_main_~x~0#1| (* |v_ULTIMATE.start_main_~x~0#1_12| (+ (- 1) |ULTIMATE.start_main_~z~0#1|))) (= (+ |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~y~0#1|) (+ (* |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~z~0#1|) 1))))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:52,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:52,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-02-20 17:28:52,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-02-20 17:28:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:28:52,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:28:54,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-02-20 17:28:54,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {548#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-02-20 17:28:54,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {544#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {548#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:54,489 INFO L272 TraceCheckUtils]: 32: Hoare triple {564#(= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {544#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:54,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {564#(= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:54,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~c~0#1 < main_~k~0#1); {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:54,491 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {526#(not (= |__VERIFIER_assert_#in~cond| 0))} {439#true} #61#return; {533#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:54,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {526#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:54,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {583#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {526#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:54,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {439#true} ~cond := #in~cond; {583#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:28:54,492 INFO L272 TraceCheckUtils]: 25: Hoare triple {439#true} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:54,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {439#true} assume !false; {439#true} is VALID [2022-02-20 17:28:54,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {439#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {439#true} is VALID [2022-02-20 17:28:54,493 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {439#true} {439#true} #59#return; {439#true} is VALID [2022-02-20 17:28:54,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:54,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:54,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:54,493 INFO L272 TraceCheckUtils]: 18: Hoare triple {439#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:54,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {439#true} {439#true} #57#return; {439#true} is VALID [2022-02-20 17:28:54,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:54,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:54,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:54,494 INFO L272 TraceCheckUtils]: 13: Hoare triple {439#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:54,494 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {439#true} {439#true} #55#return; {439#true} is VALID [2022-02-20 17:28:54,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:54,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:54,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:54,495 INFO L272 TraceCheckUtils]: 8: Hoare triple {439#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 50 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:54,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {439#true} is VALID [2022-02-20 17:28:54,495 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {439#true} {439#true} #53#return; {439#true} is VALID [2022-02-20 17:28:54,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} assume true; {439#true} is VALID [2022-02-20 17:28:54,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-02-20 17:28:54,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-02-20 17:28:54,496 INFO L272 TraceCheckUtils]: 2: Hoare triple {439#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 50 then 1 else 0)); {439#true} is VALID [2022-02-20 17:28:54,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {439#true} is VALID [2022-02-20 17:28:54,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {439#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(10, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-02-20 17:28:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:28:54,497 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:54,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568044102] [2022-02-20 17:28:54,497 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:54,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134919949] [2022-02-20 17:28:54,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134919949] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:28:54,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:28:54,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:28:54,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972790470] [2022-02-20 17:28:54,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:28:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:28:54,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:54,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:28:54,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:54,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:28:54,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:54,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:28:54,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:28:54,520 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:28:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,663 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 17:28:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:28:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:28:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:28:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 17:28:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:28:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 17:28:54,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-02-20 17:28:54,698 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:28:54,698 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:28:54,699 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:28:54,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:28:54,700 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:54,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 17:28:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:28:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:28:54,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:54,701 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:28:54,701 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:28:54,701 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:28:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,701 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:28:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:54,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:54,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:54,701 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:28:54,701 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:28:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:54,702 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:28:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:54,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:54,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:54,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:54,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:54,702 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:28:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:28:54,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-02-20 17:28:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:54,702 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:28:54,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:28:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:54,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:54,704 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:28:54,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:54,911 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:28:54,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:28:54,937 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:28:54,937 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-20 17:28:54,938 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L854 garLoopResultBuilder]: At program point L36-2(lines 36 46) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point L36-3(lines 36 46) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:28:54,938 INFO L861 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-02-20 17:28:54,939 INFO L861 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-02-20 17:28:54,939 INFO L861 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2022-02-20 17:28:54,939 INFO L858 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2022-02-20 17:28:54,939 INFO L861 garLoopResultBuilder]: At program point L51(lines 22 52) the Hoare annotation is: true [2022-02-20 17:28:54,939 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:28:54,939 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 36 46) no Hoare annotation was computed. [2022-02-20 17:28:54,939 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-02-20 17:28:54,939 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:28:54,940 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-02-20 17:28:54,942 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:28:54,943 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:28:54,945 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:28:54,945 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:28:54,946 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:28:54,947 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:28:54,948 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 17:28:54,949 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 17:28:54,949 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:28:54,949 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:28:54,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:28:54 BoogieIcfgContainer [2022-02-20 17:28:54,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:28:54,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:28:54,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:28:54,955 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:28:54,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:48" (3/4) ... [2022-02-20 17:28:54,957 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:28:54,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:28:54,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:28:54,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:28:54,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:28:54,962 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:28:54,963 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:28:54,981 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:28:54,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:28:54,982 INFO L158 Benchmark]: Toolchain (without parser) took 6645.91ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 101.5MB in the beginning and 98.0MB in the end (delta: 3.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,983 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:54,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.24ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 101.8MB in the end (delta: -530.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.43ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 100.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,983 INFO L158 Benchmark]: Boogie Preprocessor took 12.09ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:54,984 INFO L158 Benchmark]: RCFGBuilder took 209.66ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 88.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,984 INFO L158 Benchmark]: TraceAbstraction took 6160.59ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 88.0MB in the beginning and 101.1MB in the end (delta: -13.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,984 INFO L158 Benchmark]: Witness Printer took 27.39ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 98.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:28:54,985 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.15ms. Allocated memory is still 90.2MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.24ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 101.8MB in the end (delta: -530.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.43ms. Allocated memory is still 130.0MB. Free memory was 101.8MB in the beginning and 100.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.09ms. Allocated memory is still 130.0MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 209.66ms. Allocated memory is still 130.0MB. Free memory was 99.0MB in the beginning and 88.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6160.59ms. Allocated memory was 130.0MB in the beginning and 176.2MB in the end (delta: 46.1MB). Free memory was 88.0MB in the beginning and 101.1MB in the end (delta: -13.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 27.39ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 98.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 18]: 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 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 74 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 20 PreInvPairs, 29 NumberOfFragments, 30 HoareAnnotationTreeSize, 20 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 1 QuantifiedInterpolants, 224 SizeOfPredicates, 4 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 98/100 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: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: x + y == x * z + 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:28:55,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE