./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound5.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/geo3-ll_unwindbound5.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 ecdd934011f0184386bb9e5e09961f3056f116a23d0d68c545d7785bb46c98e0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:29,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:29,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:29,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:29,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:29,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:29,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:29,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:29,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:29,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:29,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:29,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:29,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:29,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:29,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:29,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:29,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:29,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:29,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:29,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:29,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:29,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:29,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:29,677 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:29,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:29,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:29,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:29,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:29,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:29,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:29,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:29,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:29,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:29,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:29,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:29,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:29,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:29,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:29,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:29,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:29,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:29,694 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:29:29,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:29,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:29,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:29,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:29,730 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:29,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:29,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:29,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:29,731 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:29,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:29,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:29,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:29,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:29,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:29,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:29,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:29,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:29,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:29,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:29,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:29,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:29,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:29,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:29,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:29,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:29,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:29,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:29,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:29,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:29,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:29,737 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:29,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:29,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:29,737 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 -> ecdd934011f0184386bb9e5e09961f3056f116a23d0d68c545d7785bb46c98e0 [2022-02-20 17:29:29,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:30,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:30,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:30,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:30,027 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:30,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-02-20 17:29:30,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a63b188/130dccc1c4c14e40a593caec92cd3a14/FLAGd8d717172 [2022-02-20 17:29:30,448 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:30,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_unwindbound5.c [2022-02-20 17:29:30,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a63b188/130dccc1c4c14e40a593caec92cd3a14/FLAGd8d717172 [2022-02-20 17:29:30,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a63b188/130dccc1c4c14e40a593caec92cd3a14 [2022-02-20 17:29:30,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:30,887 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:30,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:30,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:30,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:30,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa2fbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:30, skipping insertion in model container [2022-02-20 17:29:30,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:30" (1/1) ... [2022-02-20 17:29:30,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:30,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:31,068 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/geo3-ll_unwindbound5.c[525,538] [2022-02-20 17:29:31,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:31,096 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:31,104 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/geo3-ll_unwindbound5.c[525,538] [2022-02-20 17:29:31,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:31,120 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:31,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31 WrapperNode [2022-02-20 17:29:31,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:31,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:31,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:31,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:31,128 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:29:31" (1/1) ... [2022-02-20 17:29:31,133 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:29:31" (1/1) ... [2022-02-20 17:29:31,150 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2022-02-20 17:29:31,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:31,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:31,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:31,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:31,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:31,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:31,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:31,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:31,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (1/1) ... [2022-02-20 17:29:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:31,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:31,212 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:29:31,218 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:29:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:31,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:31,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:31,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:31,285 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:31,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:31,398 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:31,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:31,404 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:31,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:31 BoogieIcfgContainer [2022-02-20 17:29:31,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:31,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:31,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:31,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:31,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:30" (1/3) ... [2022-02-20 17:29:31,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c59dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:31, skipping insertion in model container [2022-02-20 17:29:31,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:31" (2/3) ... [2022-02-20 17:29:31,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c59dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:31, skipping insertion in model container [2022-02-20 17:29:31,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:31" (3/3) ... [2022-02-20 17:29:31,412 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound5.c [2022-02-20 17:29:31,416 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:31,416 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:31,450 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:31,455 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:29:31,455 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:29:31,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:31,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:31,475 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:29:31,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:31,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760146700] [2022-02-20 17:29:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:31,616 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:31,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601753577] [2022-02-20 17:29:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:31,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:31,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:31,619 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:29:31,628 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:29:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:31,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:31,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20#true} is VALID [2022-02-20 17:29:31,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {20#true} is VALID [2022-02-20 17:29:31,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:29:31,735 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {21#false} is VALID [2022-02-20 17:29:31,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:29:31,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:29:31,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:29:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:31,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:31,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:31,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760146700] [2022-02-20 17:29:31,737 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:31,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601753577] [2022-02-20 17:29:31,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601753577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:31,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:31,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:31,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107324010] [2022-02-20 17:29:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:31,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:29:31,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:31,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:31,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:31,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:31,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:31,785 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,851 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:29:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:29:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:29:31,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:29:31,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:31,934 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:29:31,934 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:29:31,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:29:31,944 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:31,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:29:31,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:29:31,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:31,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:31,976 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:31,976 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:31,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,979 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:31,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:29:31,981 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:29:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:31,982 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:29:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:31,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:31,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:31,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:31,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:29:31,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:29:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:31,987 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:29:31,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:29:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:31,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:31,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:32,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:29:32,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:29:32,189 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:29:32,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:32,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534847660] [2022-02-20 17:29:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:32,209 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:32,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778047034] [2022-02-20 17:29:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:32,214 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:29:32,216 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:29:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:29:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:32,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#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);~counter~0 := 0; {132#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:32,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {132#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:32,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(<= ~counter~0 0)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {139#(<= |ULTIMATE.start_main_#t~post7#1| 0)} is VALID [2022-02-20 17:29:32,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(<= |ULTIMATE.start_main_#t~post7#1| 0)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {128#false} is VALID [2022-02-20 17:29:32,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {128#false} is VALID [2022-02-20 17:29:32,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-02-20 17:29:32,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#false} assume 0 == ~cond; {128#false} is VALID [2022-02-20 17:29:32,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-02-20 17:29:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:32,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:32,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:32,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534847660] [2022-02-20 17:29:32,377 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:32,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778047034] [2022-02-20 17:29:32,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778047034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:32,379 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:32,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:29:32,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687838867] [2022-02-20 17:29:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:32,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:32,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:32,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:32,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:29:32,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:29:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:32,391 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:32,446 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:29:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:29:32,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:29:32,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:29:32,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:32,484 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:29:32,484 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:29:32,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:29:32,488 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:32,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:29:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:29:32,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:32,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:32,498 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:32,498 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:32,501 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:32,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:32,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:29:32,502 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:29:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:32,505 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:29:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:32,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:32,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:32,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:32,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:29:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:29:32,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:29:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:32,509 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:29:32,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:29:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:29:32,510 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:32,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:32,538 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:29:32,723 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,SelfDestructingSolverStorable1 [2022-02-20 17:29:32,724 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:29:32,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:32,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564892438] [2022-02-20 17:29:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:32,739 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:32,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403532566] [2022-02-20 17:29:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:32,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:32,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:32,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:32,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:29:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:29:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:32,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:32,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#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);~counter~0 := 0; {233#true} is VALID [2022-02-20 17:29:32,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#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_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:32,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {241#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~az~0#1| (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:32,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:32,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {234#false} is VALID [2022-02-20 17:29:32,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 17:29:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:32,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:32,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:32,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564892438] [2022-02-20 17:29:32,902 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:32,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403532566] [2022-02-20 17:29:32,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403532566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:32,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:32,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:32,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593406449] [2022-02-20 17:29:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:32,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:32,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:32,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:32,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:32,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:32,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:32,916 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,004 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 17:29:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:29:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-20 17:29:33,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-02-20 17:29:33,032 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:29:33,033 INFO L225 Difference]: With dead ends: 24 [2022-02-20 17:29:33,034 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:33,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:29:33,035 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:33,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:33,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:33,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,041 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,041 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,043 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:33,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:33,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:33,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:33,044 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:29:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,045 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:33,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:33,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:33,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:33,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:33,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2022-02-20 17:29:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:33,048 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:33,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:29:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:29:33,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:33,049 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:33,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:33,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:33,266 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-02-20 17:29:33,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:33,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167576590] [2022-02-20 17:29:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:33,278 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:33,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136836083] [2022-02-20 17:29:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:33,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:33,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:33,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:33,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:29:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:33,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:29:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:33,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:33,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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);~counter~0 := 0; {370#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:33,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {370#(<= ~counter~0 0)} is VALID [2022-02-20 17:29:33,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#(<= ~counter~0 0)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {377#(<= ~counter~0 1)} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 1)} ~cond := #in~cond; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 1)} assume !(0 == ~cond); {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 1)} assume true; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,424 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {377#(<= ~counter~0 1)} {377#(<= ~counter~0 1)} #39#return; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 1)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {377#(<= ~counter~0 1)} is VALID [2022-02-20 17:29:33,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {377#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {402#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:29:33,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {366#false} is VALID [2022-02-20 17:29:33,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {366#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {366#false} is VALID [2022-02-20 17:29:33,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#false} ~cond := #in~cond; {366#false} is VALID [2022-02-20 17:29:33,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {366#false} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:29:33,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:29:33,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:33,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:33,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 17:29:33,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {366#false} assume 0 == ~cond; {366#false} is VALID [2022-02-20 17:29:33,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#false} ~cond := #in~cond; {366#false} is VALID [2022-02-20 17:29:33,530 INFO L272 TraceCheckUtils]: 12: Hoare triple {366#false} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {366#false} is VALID [2022-02-20 17:29:33,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#(< |ULTIMATE.start_main_#t~post7#1| 5)} assume !(main_#t~post7#1 < 5);havoc main_#t~post7#1; {366#false} is VALID [2022-02-20 17:29:33,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {434#(< ~counter~0 5)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {430#(< |ULTIMATE.start_main_#t~post7#1| 5)} is VALID [2022-02-20 17:29:33,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(< ~counter~0 5)} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {434#(< ~counter~0 5)} is VALID [2022-02-20 17:29:33,532 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {365#true} {434#(< ~counter~0 5)} #39#return; {434#(< ~counter~0 5)} is VALID [2022-02-20 17:29:33,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#true} assume true; {365#true} is VALID [2022-02-20 17:29:33,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#true} assume !(0 == ~cond); {365#true} is VALID [2022-02-20 17:29:33,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#true} ~cond := #in~cond; {365#true} is VALID [2022-02-20 17:29:33,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {434#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {365#true} is VALID [2022-02-20 17:29:33,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#(< ~counter~0 5)} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {434#(< ~counter~0 5)} is VALID [2022-02-20 17:29:33,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#(< ~counter~0 4)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {434#(< ~counter~0 5)} is VALID [2022-02-20 17:29:33,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#(< ~counter~0 4)} 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_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {459#(< ~counter~0 4)} is VALID [2022-02-20 17:29:33,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#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);~counter~0 := 0; {459#(< ~counter~0 4)} is VALID [2022-02-20 17:29:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:33,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:33,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167576590] [2022-02-20 17:29:33,536 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:33,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136836083] [2022-02-20 17:29:33,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136836083] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:33,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:33,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:29:33,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696966943] [2022-02-20 17:29:33,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:33,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:33,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:33,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:33,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:29:33,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:33,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:29:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:29:33,562 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,727 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 17:29:33,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:29:33,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:33,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 17:29:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 17:29:33,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2022-02-20 17:29:33,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:33,781 INFO L225 Difference]: With dead ends: 52 [2022-02-20 17:29:33,782 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:29:33,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:29:33,783 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:33,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:29:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-02-20 17:29:33,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:33,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:33,795 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:33,796 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,798 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:29:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:29:33,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:33,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:33,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:29:33,800 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:29:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:33,802 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-20 17:29:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-20 17:29:33,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:33,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:33,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:33,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-02-20 17:29:33,804 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 16 [2022-02-20 17:29:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:33,805 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-02-20 17:29:33,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 17:29:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:29:33,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:33,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:33,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:34,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:34,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-02-20 17:29:34,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:34,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359813895] [2022-02-20 17:29:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:34,032 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:34,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524404589] [2022-02-20 17:29:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:34,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:34,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:34,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:29:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:34,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:29:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:34,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:34,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#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);~counter~0 := 0; {688#true} is VALID [2022-02-20 17:29:34,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#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_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:34,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:34,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:34,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {688#true} is VALID [2022-02-20 17:29:34,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {688#true} ~cond := #in~cond; {709#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:34,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:34,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:34,324 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {713#(not (= |__VERIFIER_assert_#in~cond| 0))} {696#(and (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #39#return; {720#(and (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:29:34,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#(and (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) (= |ULTIMATE.start_main_~y~0#1| 1) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:34,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:34,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} is VALID [2022-02-20 17:29:34,335 INFO L272 TraceCheckUtils]: 12: Hoare triple {724#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~x~0#1|) (= (+ |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~a~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:34,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:34,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {689#false} is VALID [2022-02-20 17:29:34,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#false} assume !false; {689#false} is VALID [2022-02-20 17:29:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:34,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:45,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#false} assume !false; {689#false} is VALID [2022-02-20 17:29:45,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {738#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {689#false} is VALID [2022-02-20 17:29:45,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {738#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:45,109 INFO L272 TraceCheckUtils]: 12: Hoare triple {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {734#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:45,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} assume !!(main_~c~0#1 < main_~k~0#1);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := main_~x~0#1 * main_~z~0#1 + main_~a~0#1;main_~y~0#1 := main_~y~0#1 * main_~z~0#1; {754#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:45,161 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {713#(not (= |__VERIFIER_assert_#in~cond| 0))} {688#true} #39#return; {764#(= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~az~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~a~0#1| (* (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:45,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:45,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:29:45,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {688#true} ~cond := #in~cond; {777#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:29:45,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {688#true} call __VERIFIER_assert((if 0 == main_~z~0#1 * main_~x~0#1 - main_~x~0#1 + main_~a~0#1 - main_~az~0#1 * main_~y~0#1 then 1 else 0)); {688#true} is VALID [2022-02-20 17:29:45,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {688#true} assume !!(main_#t~post7#1 < 5);havoc main_#t~post7#1; {688#true} is VALID [2022-02-20 17:29:45,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {688#true} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {688#true} is VALID [2022-02-20 17:29:45,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#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_#t~nondet6#1, main_#t~post7#1, main_~z~0#1, main_~a~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1, main_~az~0#1;havoc main_~z~0#1;havoc main_~a~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;havoc main_~az~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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~a~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~k~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_~a~0#1;main_~y~0#1 := 1;main_~c~0#1 := 1;main_~az~0#1 := main_~a~0#1 * main_~z~0#1; {688#true} is VALID [2022-02-20 17:29:45,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#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);~counter~0 := 0; {688#true} is VALID [2022-02-20 17:29:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:29:45,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:45,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359813895] [2022-02-20 17:29:45,165 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:45,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524404589] [2022-02-20 17:29:45,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524404589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:29:45,165 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:29:45,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-02-20 17:29:45,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478118949] [2022-02-20 17:29:45,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:29:45,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:45,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:45,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:45,254 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:29:45,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 17:29:45,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:45,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 17:29:45,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:45,255 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:46,319 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 17:29:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:29:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:29:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-02-20 17:29:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-02-20 17:29:46,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-02-20 17:29:46,640 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:29:46,640 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:29:46,640 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:29:46,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:29:46,641 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:46,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 65 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:29:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:29:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:29:46,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:46,645 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:29:46,645 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:29:46,645 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:29:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:46,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:46,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:46,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:46,646 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:29:46,646 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:29:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:46,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:46,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:46,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:46,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:46,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:46,647 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:29:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:29:46,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 17:29:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:46,647 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:29:46,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:46,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:46,650 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:46,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:46,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:46,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:29:47,045 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:29:47,045 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point L34-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L854 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:47,046 INFO L854 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L861 garLoopResultBuilder]: At program point L45(lines 22 46) the Hoare annotation is: true [2022-02-20 17:29:47,046 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~a~0#1|) (+ |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~az~0#1| |ULTIMATE.start_main_~y~0#1|))) [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 34 43) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:29:47,046 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:29:47,047 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:29:47,047 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:47,047 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:47,047 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:29:47,049 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:29:47,050 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:47,053 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:29:47,053 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:47,053 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:29:47,053 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:47,053 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:47,054 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:47,054 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:47,054 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:47,054 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:29:47,055 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:47,056 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:47,056 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:29:47,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:29:47 BoogieIcfgContainer [2022-02-20 17:29:47,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:29:47,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:29:47,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:29:47,063 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:29:47,064 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:31" (3/4) ... [2022-02-20 17:29:47,066 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:29:47,070 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:29:47,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:29:47,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:29:47,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:29:47,073 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:29:47,097 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:29:47,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:29:47,098 INFO L158 Benchmark]: Toolchain (without parser) took 16210.98ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 58.3MB in the beginning and 83.9MB in the end (delta: -25.6MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,099 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 44.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:47,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.92ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 65.8MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.26ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:47,100 INFO L158 Benchmark]: Boogie Preprocessor took 26.45ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 63.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,100 INFO L158 Benchmark]: RCFGBuilder took 225.01ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 52.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,100 INFO L158 Benchmark]: TraceAbstraction took 15655.71ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 52.1MB in the beginning and 87.0MB in the end (delta: -34.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,101 INFO L158 Benchmark]: Witness Printer took 34.50ms. Allocated memory is still 132.1MB. Free memory was 87.0MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:47,102 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.22ms. Allocated memory is still 90.2MB. Free memory was 45.0MB in the beginning and 44.9MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.92ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 65.8MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.26ms. Allocated memory is still 90.2MB. Free memory was 65.8MB in the beginning and 64.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.45ms. Allocated memory is still 90.2MB. Free memory was 64.4MB in the beginning and 63.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 225.01ms. Allocated memory is still 90.2MB. Free memory was 63.2MB in the beginning and 52.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15655.71ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 52.1MB in the beginning and 87.0MB in the end (delta: -34.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Witness Printer took 34.50ms. Allocated memory is still 132.1MB. Free memory was 87.0MB in the beginning and 83.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 72 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 16 PreInvPairs, 30 NumberOfFragments, 35 HoareAnnotationTreeSize, 16 FomulaSimplifications, 124 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 6 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 9/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: x * z + a == x + az * y RESULT: Ultimate proved your program to be correct! [2022-02-20 17:29:47,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE