./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/mannadiv_valuebound1.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/mannadiv_valuebound1.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 4f0dc25e497896e48962fc4f59a3ea4856b5eb0408b9845e68b04a0b0a132067 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:37:48,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:37:48,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:37:48,572 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:37:48,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:37:48,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:37:48,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:37:48,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:37:48,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:37:48,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:37:48,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:37:48,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:37:48,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:37:48,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:37:48,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:37:48,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:37:48,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:37:48,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:37:48,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:37:48,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:37:48,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:37:48,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:37:48,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:37:48,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:37:48,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:37:48,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:37:48,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:37:48,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:37:48,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:37:48,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:37:48,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:37:48,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:37:48,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:37:48,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:37:48,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:37:48,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:37:48,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:37:48,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:37:48,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:37:48,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:37:48,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:37:48,612 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:37:48,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:37:48,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:37:48,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:37:48,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:37:48,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:37:48,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:37:48,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:37:48,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:37:48,638 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:37:48,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:37:48,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:37:48,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:37:48,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:37:48,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:37:48,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:37:48,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:37:48,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:37:48,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:37:48,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:37:48,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:37:48,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:37:48,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:37:48,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:37:48,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:37:48,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:37:48,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:37:48,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:37:48,643 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 -> 4f0dc25e497896e48962fc4f59a3ea4856b5eb0408b9845e68b04a0b0a132067 [2022-02-20 17:37:48,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:37:48,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:37:48,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:37:48,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:37:48,871 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:37:48,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/mannadiv_valuebound1.c [2022-02-20 17:37:48,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47c4c716/0c742a31b6034dfa9f7de9f4972b2afa/FLAGb49422fb2 [2022-02-20 17:37:49,224 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:37:49,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_valuebound1.c [2022-02-20 17:37:49,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47c4c716/0c742a31b6034dfa9f7de9f4972b2afa/FLAGb49422fb2 [2022-02-20 17:37:49,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47c4c716/0c742a31b6034dfa9f7de9f4972b2afa [2022-02-20 17:37:49,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:37:49,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:37:49,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:37:49,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:37:49,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:37:49,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e732197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49, skipping insertion in model container [2022-02-20 17:37:49,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:37:49,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:37:49,817 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/mannadiv_valuebound1.c[573,586] [2022-02-20 17:37:49,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:37:49,845 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:37:49,855 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/mannadiv_valuebound1.c[573,586] [2022-02-20 17:37:49,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:37:49,878 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:37:49,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49 WrapperNode [2022-02-20 17:37:49,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:37:49,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:37:49,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:37:49,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:37:49,884 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:37:49" (1/1) ... [2022-02-20 17:37:49,889 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:37:49" (1/1) ... [2022-02-20 17:37:49,904 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 17:37:49,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:37:49,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:37:49,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:37:49,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:37:49,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:37:49,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:37:49,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:37:49,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:37:49,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (1/1) ... [2022-02-20 17:37:49,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:37:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:37:49,962 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:37:49,968 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:37:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:37:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:37:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:37:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:37:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:37:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:37:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:37:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:37:50,034 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:37:50,035 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:37:50,166 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:37:50,170 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:37:50,171 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:37:50,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:37:50 BoogieIcfgContainer [2022-02-20 17:37:50,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:37:50,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:37:50,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:37:50,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:37:50,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:37:49" (1/3) ... [2022-02-20 17:37:50,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad167ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:37:50, skipping insertion in model container [2022-02-20 17:37:50,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:37:49" (2/3) ... [2022-02-20 17:37:50,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad167ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:37:50, skipping insertion in model container [2022-02-20 17:37:50,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:37:50" (3/3) ... [2022-02-20 17:37:50,191 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_valuebound1.c [2022-02-20 17:37:50,194 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:37:50,195 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:37:50,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:37:50,226 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:37:50,226 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:37:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:37:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:37:50,255 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:37:50,256 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:37:50,256 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:37:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:37:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1928678447, now seen corresponding path program 1 times [2022-02-20 17:37:50,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:37:50,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019799868] [2022-02-20 17:37:50,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:37:50,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:37:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:50,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:37:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:50,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:37:50,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:37:50,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:37:50,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #55#return; {28#false} is VALID [2022-02-20 17:37:50,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:37:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:50,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:37:50,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:37:50,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:37:50,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #57#return; {28#false} is VALID [2022-02-20 17:37:50,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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(11, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-02-20 17:37:50,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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_~x1~0#1, main_~x2~0#1, main_~y1~0#1, main_~y2~0#1, main_~y3~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;havoc main_~y3~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {27#true} is VALID [2022-02-20 17:37:50,442 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~x1~0#1 >= 0 then 1 else 0)); {27#true} is VALID [2022-02-20 17:37:50,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:37:50,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:37:50,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:37:50,444 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #55#return; {28#false} is VALID [2022-02-20 17:37:50,444 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#false} call assume_abort_if_not((if 0 != main_~x2~0#1 then 1 else 0)); {27#true} is VALID [2022-02-20 17:37:50,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:37:50,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:37:50,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:37:50,445 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#false} {28#false} #57#return; {28#false} is VALID [2022-02-20 17:37:50,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} main_~y1~0#1 := 0;main_~y2~0#1 := 0;main_~y3~0#1 := main_~x1~0#1; {28#false} is VALID [2022-02-20 17:37:50,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:37:50,446 INFO L272 TraceCheckUtils]: 14: Hoare triple {28#false} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 == main_~x1~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:37:50,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:37:50,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:37:50,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:37:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:37:50,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:37:50,449 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019799868] [2022-02-20 17:37:50,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019799868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:37:50,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:37:50,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:37:50,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944703072] [2022-02-20 17:37:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:37:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:37:50,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:37:50,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:37:50,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:50,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:37:50,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:37:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:37:50,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:37:50,509 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:37:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:50,555 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:37:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:37:50,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:37:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:37:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:37:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:37:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:37:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:37:50,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:37:50,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:50,636 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:37:50,638 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:37:50,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:37:50,642 INFO L933 BasicCegarLoop]: 27 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, 27 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:37:50,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:37:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:37:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:37:50,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:37:50,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:37:50,662 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:37:50,662 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:37:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:50,665 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:37:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:37:50,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:50,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:50,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-02-20 17:37:50,666 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-02-20 17:37:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:50,673 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 17:37:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:37:50,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:50,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:50,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:37:50,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:37:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:37:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 17:37:50,683 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2022-02-20 17:37:50,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:37:50,683 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 17:37:50,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:37:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 17:37:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:37:50,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:37:50,684 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:37:50,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:37:50,685 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:37:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:37:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1584630691, now seen corresponding path program 1 times [2022-02-20 17:37:50,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:37:50,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487401632] [2022-02-20 17:37:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:37:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:37:50,708 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:37:50,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476576072] [2022-02-20 17:37:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:37:50,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:37:50,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:37:50,710 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:37:50,711 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:37:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:50,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 17:37:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:50,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:37:51,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#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(11, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-02-20 17:37:51,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#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_~x1~0#1, main_~x2~0#1, main_~y1~0#1, main_~y2~0#1, main_~y3~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;havoc main_~y3~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} is VALID [2022-02-20 17:37:51,133 INFO L272 TraceCheckUtils]: 2: Hoare triple {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} call assume_abort_if_not((if main_~x1~0#1 >= 0 then 1 else 0)); {166#true} is VALID [2022-02-20 17:37:51,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {166#true} ~cond := #in~cond; {166#true} is VALID [2022-02-20 17:37:51,134 INFO L290 TraceCheckUtils]: 4: Hoare triple {166#true} assume !(0 == ~cond); {166#true} is VALID [2022-02-20 17:37:51,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} assume true; {166#true} is VALID [2022-02-20 17:37:51,134 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {166#true} {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} #55#return; {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} is VALID [2022-02-20 17:37:51,134 INFO L272 TraceCheckUtils]: 7: Hoare triple {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} call assume_abort_if_not((if 0 != main_~x2~0#1 then 1 else 0)); {166#true} is VALID [2022-02-20 17:37:51,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#true} ~cond := #in~cond; {196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:37:51,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:37:51,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {200#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:37:51,136 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {200#(not (= |assume_abort_if_not_#in~cond| 0))} {174#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} #57#return; {207#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} is VALID [2022-02-20 17:37:51,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} main_~y1~0#1 := 0;main_~y2~0#1 := 0;main_~y3~0#1 := main_~x1~0#1; {211#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (= |ULTIMATE.start_main_~y2~0#1| 0) (= |ULTIMATE.start_main_~x1~0#1| |ULTIMATE.start_main_~y3~0#1|) (= |ULTIMATE.start_main_~y1~0#1| 0) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} is VALID [2022-02-20 17:37:51,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {211#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (= |ULTIMATE.start_main_~y2~0#1| 0) (= |ULTIMATE.start_main_~x1~0#1| |ULTIMATE.start_main_~y3~0#1|) (= |ULTIMATE.start_main_~y1~0#1| 0) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} assume !false; {211#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (= |ULTIMATE.start_main_~y2~0#1| 0) (= |ULTIMATE.start_main_~x1~0#1| |ULTIMATE.start_main_~y3~0#1|) (= |ULTIMATE.start_main_~y1~0#1| 0) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} is VALID [2022-02-20 17:37:51,139 INFO L272 TraceCheckUtils]: 14: Hoare triple {211#(and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (= |ULTIMATE.start_main_~y2~0#1| 0) (= |ULTIMATE.start_main_~x1~0#1| |ULTIMATE.start_main_~y3~0#1|) (= |ULTIMATE.start_main_~y1~0#1| 0) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)))} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 + main_~y3~0#1 == main_~x1~0#1 then 1 else 0)); {218#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:37:51,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {222#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:37:51,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2022-02-20 17:37:51,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-02-20 17:37:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:37:51,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:37:51,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:37:51,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487401632] [2022-02-20 17:37:51,141 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:37:51,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476576072] [2022-02-20 17:37:51,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476576072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:37:51,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:37:51,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 17:37:51,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188904004] [2022-02-20 17:37:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:37:51,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:37:51,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:37:51,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:37:51,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:51,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:37:51,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:37:51,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:37:51,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:37:51,160 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:37:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:51,447 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:37:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:37:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:37:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:37:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:37:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-02-20 17:37:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:37:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-02-20 17:37:51,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-02-20 17:37:51,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:51,495 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:37:51,495 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:37:51,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:37:51,497 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:37:51,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:37:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:37:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-02-20 17:37:51,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:37:51,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:37:51,516 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:37:51,517 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:37:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:51,519 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-20 17:37:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-20 17:37:51,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:51,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:51,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:37:51,520 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:37:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:51,522 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-20 17:37:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-20 17:37:51,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:51,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:51,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:37:51,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:37:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:37:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-02-20 17:37:51,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 18 [2022-02-20 17:37:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:37:51,525 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-20 17:37:51,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:37:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-20 17:37:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:37:51,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:37:51,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:37:51,566 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:37:51,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:37:51,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:37:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:37:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1566339285, now seen corresponding path program 1 times [2022-02-20 17:37:51,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:37:51,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26285478] [2022-02-20 17:37:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:37:51,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:37:51,764 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:37:51,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719687230] [2022-02-20 17:37:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:37:51,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:37:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:37:51,769 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:37:51,769 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:37:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:51,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:37:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:37:51,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:37:52,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#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(11, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-02-20 17:37:52,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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_~x1~0#1, main_~x2~0#1, main_~y1~0#1, main_~y2~0#1, main_~y3~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;havoc main_~y3~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {368#true} is VALID [2022-02-20 17:37:52,045 INFO L272 TraceCheckUtils]: 2: Hoare triple {368#true} call assume_abort_if_not((if main_~x1~0#1 >= 0 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:52,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-02-20 17:37:52,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-02-20 17:37:52,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} assume true; {368#true} is VALID [2022-02-20 17:37:52,046 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {368#true} {368#true} #55#return; {368#true} is VALID [2022-02-20 17:37:52,046 INFO L272 TraceCheckUtils]: 7: Hoare triple {368#true} call assume_abort_if_not((if 0 != main_~x2~0#1 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:52,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-02-20 17:37:52,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-02-20 17:37:52,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-02-20 17:37:52,047 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {368#true} #57#return; {368#true} is VALID [2022-02-20 17:37:52,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#true} main_~y1~0#1 := 0;main_~y2~0#1 := 0;main_~y3~0#1 := main_~x1~0#1; {368#true} is VALID [2022-02-20 17:37:52,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#true} assume !false; {368#true} is VALID [2022-02-20 17:37:52,048 INFO L272 TraceCheckUtils]: 14: Hoare triple {368#true} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 + main_~y3~0#1 == main_~x1~0#1 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:52,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#true} ~cond := #in~cond; {418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:37:52,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {418#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:37:52,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:37:52,051 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {422#(not (= |__VERIFIER_assert_#in~cond| 0))} {368#true} #59#return; {429#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y3~0#1|))} is VALID [2022-02-20 17:37:52,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y3~0#1|))} assume !(0 != main_~y3~0#1); {433#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-20 17:37:52,053 INFO L272 TraceCheckUtils]: 20: Hoare triple {433#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|))} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 == main_~x1~0#1 then 1 else 0)); {437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:37:52,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:37:52,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-02-20 17:37:52,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-02-20 17:37:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:37:52,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:37:58,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-02-20 17:37:58,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {441#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {369#false} is VALID [2022-02-20 17:37:58,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {437#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {441#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:37:58,908 INFO L272 TraceCheckUtils]: 20: Hoare triple {433#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|))} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 == main_~x1~0#1 then 1 else 0)); {437#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:37:58,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {460#(or (= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|)) (not (= |ULTIMATE.start_main_~y3~0#1| 0)))} assume !(0 != main_~y3~0#1); {433#(= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|))} is VALID [2022-02-20 17:37:58,909 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {422#(not (= |__VERIFIER_assert_#in~cond| 0))} {368#true} #59#return; {460#(or (= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1|)) (not (= |ULTIMATE.start_main_~y3~0#1| 0)))} is VALID [2022-02-20 17:37:58,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:37:58,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {422#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:37:58,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#true} ~cond := #in~cond; {473#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:37:58,911 INFO L272 TraceCheckUtils]: 14: Hoare triple {368#true} call __VERIFIER_assert((if main_~y1~0#1 * main_~x2~0#1 + main_~y2~0#1 + main_~y3~0#1 == main_~x1~0#1 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:58,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#true} assume !false; {368#true} is VALID [2022-02-20 17:37:58,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#true} main_~y1~0#1 := 0;main_~y2~0#1 := 0;main_~y3~0#1 := main_~x1~0#1; {368#true} is VALID [2022-02-20 17:37:58,912 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {368#true} {368#true} #57#return; {368#true} is VALID [2022-02-20 17:37:58,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#true} assume true; {368#true} is VALID [2022-02-20 17:37:58,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-02-20 17:37:58,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-02-20 17:37:58,912 INFO L272 TraceCheckUtils]: 7: Hoare triple {368#true} call assume_abort_if_not((if 0 != main_~x2~0#1 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:58,912 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {368#true} {368#true} #55#return; {368#true} is VALID [2022-02-20 17:37:58,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} assume true; {368#true} is VALID [2022-02-20 17:37:58,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {368#true} assume !(0 == ~cond); {368#true} is VALID [2022-02-20 17:37:58,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {368#true} ~cond := #in~cond; {368#true} is VALID [2022-02-20 17:37:58,913 INFO L272 TraceCheckUtils]: 2: Hoare triple {368#true} call assume_abort_if_not((if main_~x1~0#1 >= 0 then 1 else 0)); {368#true} is VALID [2022-02-20 17:37:58,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#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_~x1~0#1, main_~x2~0#1, main_~y1~0#1, main_~y2~0#1, main_~y3~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_~y1~0#1;havoc main_~y2~0#1;havoc main_~y3~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {368#true} is VALID [2022-02-20 17:37:58,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#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(11, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-02-20 17:37:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:37:58,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:37:58,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26285478] [2022-02-20 17:37:58,914 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:37:58,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719687230] [2022-02-20 17:37:58,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719687230] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:37:58,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:37:58,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:37:58,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818774201] [2022-02-20 17:37:58,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:37:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2022-02-20 17:37:58,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:37:58,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:37:58,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:58,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:37:58,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:37:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:37:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:37:58,931 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:37:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:59,087 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-02-20 17:37:59,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:37:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2022-02-20 17:37:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:37:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:37:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 17:37:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:37:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 17:37:59,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 17:37:59,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:37:59,111 INFO L225 Difference]: With dead ends: 26 [2022-02-20 17:37:59,111 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:37:59,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:37:59,112 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:37:59,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:37:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:37:59,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:37:59,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:37:59,113 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:37:59,113 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:37:59,113 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:37:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:59,113 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:37:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:37:59,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:59,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:59,114 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:37:59,114 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:37:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:37:59,114 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:37:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:37:59,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:59,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:37:59,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:37:59,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:37:59,114 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:37:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:37:59,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-02-20 17:37:59,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:37:59,114 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:37:59,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:37:59,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:37:59,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:37:59,116 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:37:59,136 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:37:59,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:37:59,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:37:59,427 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|))) (and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (= |ULTIMATE.start_main_~x1~0#1| (+ .cse0 |ULTIMATE.start_main_~y2~0#1|)) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)) (= |ULTIMATE.start_main_~x1~0#1| (+ .cse0 |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y3~0#1|)))) [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L861 garLoopResultBuilder]: At program point L50(lines 22 51) the Hoare annotation is: true [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 47) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L854 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)) (= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y3~0#1|))) [2022-02-20 17:37:59,428 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (not (= |ULTIMATE.start_main_~x2~0#1| 0)) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648)) (= |ULTIMATE.start_main_~x1~0#1| (+ (* |ULTIMATE.start_main_~x2~0#1| |ULTIMATE.start_main_~y1~0#1|) |ULTIMATE.start_main_~y2~0#1| |ULTIMATE.start_main_~y3~0#1|))) [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L36-1(lines 35 48) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648))) [2022-02-20 17:37:59,428 INFO L854 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~x2~0#1| 2147483648))) [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 17:37:59,428 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:37:59,429 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-02-20 17:37:59,431 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:37:59,432 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:37:59,434 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:37:59,434 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:37:59,435 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:37:59,439 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:37:59,439 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:37:59,439 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:37:59,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:37:59,440 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:37:59,440 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:37:59,440 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:37:59,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:37:59 BoogieIcfgContainer [2022-02-20 17:37:59,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:37:59,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:37:59,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:37:59,447 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:37:59,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:37:50" (3/4) ... [2022-02-20 17:37:59,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:37:59,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:37:59,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:37:59,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:37:59,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:37:59,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:37:59,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:37:59,473 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:37:59,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:37:59,474 INFO L158 Benchmark]: Toolchain (without parser) took 9815.22ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 58.5MB in the beginning and 92.3MB in the end (delta: -33.8MB). Peak memory consumption was 591.8kB. Max. memory is 16.1GB. [2022-02-20 17:37:59,474 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:37:59,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 72.2MB in the end (delta: -13.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-02-20 17:37:59,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.98ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:37:59,475 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:37:59,475 INFO L158 Benchmark]: RCFGBuilder took 234.76ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 59.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:37:59,476 INFO L158 Benchmark]: TraceAbstraction took 9273.07ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 58.9MB in the beginning and 95.3MB in the end (delta: -36.4MB). Peak memory consumption was 911.9kB. Max. memory is 16.1GB. [2022-02-20 17:37:59,476 INFO L158 Benchmark]: Witness Printer took 27.19ms. Allocated memory is still 132.1MB. Free memory was 95.3MB in the beginning and 92.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:37:59,477 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.18ms. Allocated memory is still 96.5MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 72.2MB in the end (delta: -13.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.98ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 96.5MB. Free memory was 70.6MB in the beginning and 69.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.76ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 59.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9273.07ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 58.9MB in the beginning and 95.3MB in the end (delta: -36.4MB). Peak memory consumption was 911.9kB. Max. memory is 16.1GB. * Witness Printer took 27.19ms. Allocated memory is still 132.1MB. Free memory was 95.3MB in the beginning and 92.3MB 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: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 55 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 21 NumberOfFragments, 91 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 86 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 10 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 18/20 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: 35]: Loop Invariant Derived loop invariant: ((x2 <= 2147483647 && !(x2 == 0)) && 0 <= x2 + 2147483648) && x1 == x2 * y1 + y2 + y3 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:37:59,491 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