./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.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/freire1_unwindbound2.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 de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:41,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:41,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:41,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:41,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:41,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:41,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:41,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:41,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:41,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:41,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:41,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:41,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:41,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:41,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:41,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:41,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:41,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:41,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:41,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:41,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:41,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:41,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:41,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:41,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:41,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:41,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:41,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:41,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:41,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:41,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:41,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:41,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:41,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:41,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:41,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:41,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:41,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:41,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:41,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:41,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:41,541 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:25:41,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:41,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:41,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:41,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:41,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:41,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:41,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:41,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:41,577 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:41,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:41,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:41,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:25:41,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:41,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:41,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:41,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:41,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:41,579 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:41,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:41,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:41,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:41,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:41,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:41,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:41,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:41,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:41,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:41,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:41,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:25:41,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:25:41,583 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:41,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:41,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:41,584 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 -> de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 [2022-02-20 17:25:41,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:41,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:41,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:41,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:41,841 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:41,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2022-02-20 17:25:41,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd49e821/a5a48163eea340bc9f7b795dc17601cb/FLAG588bc11c3 [2022-02-20 17:25:42,305 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:42,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2022-02-20 17:25:42,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd49e821/a5a48163eea340bc9f7b795dc17601cb/FLAG588bc11c3 [2022-02-20 17:25:42,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dd49e821/a5a48163eea340bc9f7b795dc17601cb [2022-02-20 17:25:42,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:42,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:42,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:42,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:42,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:42,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61999503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42, skipping insertion in model container [2022-02-20 17:25:42,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:42,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:42,528 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/freire1_unwindbound2.c[712,725] [2022-02-20 17:25:42,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:42,564 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:42,576 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/freire1_unwindbound2.c[712,725] [2022-02-20 17:25:42,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:42,604 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:42,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42 WrapperNode [2022-02-20 17:25:42,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:42,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:42,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:42,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:42,612 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:25:42" (1/1) ... [2022-02-20 17:25:42,618 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:25:42" (1/1) ... [2022-02-20 17:25:42,638 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-02-20 17:25:42,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:42,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:42,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:42,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:42,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:42,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:42,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:42,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:42,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (1/1) ... [2022-02-20 17:25:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:42,713 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:25:42,723 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:25:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:25:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:42,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:42,798 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:42,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:42,889 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:42,894 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:42,895 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:42,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:42 BoogieIcfgContainer [2022-02-20 17:25:42,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:42,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:42,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:42,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:42,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:42" (1/3) ... [2022-02-20 17:25:42,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fa6cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:42, skipping insertion in model container [2022-02-20 17:25:42,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:42" (2/3) ... [2022-02-20 17:25:42,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53fa6cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:42, skipping insertion in model container [2022-02-20 17:25:42,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:42" (3/3) ... [2022-02-20 17:25:42,904 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound2.c [2022-02-20 17:25:42,908 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:42,908 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:42,944 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:42,950 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:25:42,950 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:25:42,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:42,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:42,971 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:42,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:25:42,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:42,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195319511] [2022-02-20 17:25:42,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:42,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:43,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20#true} is VALID [2022-02-20 17:25:43,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~a~0#1, 2.0);main_~r~0#1 := 0; {20#true} is VALID [2022-02-20 17:25:43,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:25:43,124 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(main_~r~0#1 * main_~r~0#1), main_~a~0#1), ~convertINTToDOUBLE(main_~r~0#1)), ~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), main_~x~0#1))) then 1 else 0)); {21#false} is VALID [2022-02-20 17:25:43,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:25:43,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:25:43,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:25:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:25:43,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:43,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195319511] [2022-02-20 17:25:43,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195319511] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:43,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:43,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:43,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054609920] [2022-02-20 17:25:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:25:43,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:43,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:43,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:43,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:43,214 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,262 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:25:43,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:25:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:25:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:25:43,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:25:43,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:43,350 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:25:43,350 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:25:43,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:43,356 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:43,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:25:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:25:43,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:43,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,391 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,392 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,395 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:25:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:43,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:43,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:25:43,396 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:25:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,399 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:25:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:43,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:43,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:43,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:43,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:25:43,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:25:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:43,403 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:25:43,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:25:43,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:43,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:43,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:25:43,405 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:25:43,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:43,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745617485] [2022-02-20 17:25:43,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:43,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:43,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {111#(= ~counter~0 0)} is VALID [2022-02-20 17:25:43,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~a~0#1, 2.0);main_~r~0#1 := 0; {111#(= ~counter~0 0)} is VALID [2022-02-20 17:25:43,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {112#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:25:43,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 2);havoc main_#t~post5#1; {110#false} is VALID [2022-02-20 17:25:43,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#false} call __VERIFIER_assert((if 0 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(main_~r~0#1 * main_~r~0#1), main_~a~0#1), ~convertINTToDOUBLE(main_~r~0#1)), ~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), main_~x~0#1))) then 1 else 0)); {110#false} is VALID [2022-02-20 17:25:43,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2022-02-20 17:25:43,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2022-02-20 17:25:43,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#false} assume !false; {110#false} is VALID [2022-02-20 17:25:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:25:43,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:43,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745617485] [2022-02-20 17:25:43,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745617485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:43,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:43,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:25:43,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540597150] [2022-02-20 17:25:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:25:43,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:43,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:43,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:25:43,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:25:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:43,474 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,509 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:25:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:25:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:25:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:25:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:25:43,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:25:43,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:43,537 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:25:43,537 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:25:43,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:43,539 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:43,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:25:43,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:25:43,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:43,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,543 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,544 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,545 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:25:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:25:43,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:43,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:43,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:25:43,547 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:25:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:43,548 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:25:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:25:43,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:43,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:43,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:43,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:25:43,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:25:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:43,553 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:25:43,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:25:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:25:43,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:43,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:43,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:25:43,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:25:43,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:43,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570859205] [2022-02-20 17:25:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:25:43,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:25:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:25:43,626 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:25:43,627 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:25:43,627 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:25:43,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:25:43,632 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:25:43,634 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:25:43,641 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == ~convertDOUBLEToINT(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(~r~0 * ~r~0), ~a~0), ~convertINTToDOUBLE(~r~0)), ~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~x~0))) then 1 else 0)); [2022-02-20 17:25:43,642 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:25:43,646 INFO L158 Benchmark]: Toolchain (without parser) took 1308.49ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 60.0MB in the beginning and 77.7MB in the end (delta: -17.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 17:25:43,646 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 65.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:43,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.47ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 70.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:25:43,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:43,648 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 94.4MB. Free memory was 68.3MB in the beginning and 67.5MB in the end (delta: 785.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:25:43,648 INFO L158 Benchmark]: RCFGBuilder took 220.40ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 58.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:25:43,649 INFO L158 Benchmark]: TraceAbstraction took 746.69ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 77.7MB in the end (delta: -20.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:25:43,651 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.20ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 65.3MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.47ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 70.0MB in the end (delta: -10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 94.4MB. Free memory was 68.3MB in the beginning and 67.5MB in the end (delta: 785.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 220.40ms. Allocated memory is still 94.4MB. Free memory was 67.2MB in the beginning and 58.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 746.69ms. Allocated memory was 94.4MB in the beginning and 119.5MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 77.7MB in the end (delta: -20.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:25:43,686 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/freire1_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:45,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:45,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:45,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:45,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:45,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:45,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:45,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:45,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:45,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:45,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:45,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:45,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:45,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:45,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:45,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:45,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:45,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:45,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:45,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:45,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:45,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:45,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:45,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:45,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:45,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:45,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:45,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:45,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:45,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:45,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:45,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:45,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:45,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:45,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:45,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:45,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:45,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:45,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:45,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:45,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:45,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:25:45,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:45,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:45,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:45,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:45,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:45,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:45,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:45,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:45,799 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:45,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:45,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:45,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:45,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:45,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:45,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:45,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:45,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:25:45,801 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:25:45,802 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:25:45,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:45,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:45,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:45,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:45,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:45,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:45,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:45,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:45,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:45,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:45,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:45,804 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:25:45,804 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:25:45,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:45,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:45,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:45,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:25:45,805 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> de6052d9944b0ce145148179524f90cfdb820a3940df4791211047874b65b687 [2022-02-20 17:25:46,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:46,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:46,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:46,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:46,135 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:46,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2022-02-20 17:25:46,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7cbbd92/45384bed78e946629b212e2ecac19d09/FLAGd3870323a [2022-02-20 17:25:46,667 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:46,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound2.c [2022-02-20 17:25:46,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7cbbd92/45384bed78e946629b212e2ecac19d09/FLAGd3870323a [2022-02-20 17:25:46,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f7cbbd92/45384bed78e946629b212e2ecac19d09 [2022-02-20 17:25:46,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:46,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:46,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:46,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:46,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:46,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4854d977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46, skipping insertion in model container [2022-02-20 17:25:46,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:46,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:46,839 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/freire1_unwindbound2.c[712,725] [2022-02-20 17:25:46,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:46,870 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:46,908 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/freire1_unwindbound2.c[712,725] [2022-02-20 17:25:46,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:46,926 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:46,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46 WrapperNode [2022-02-20 17:25:46,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:46,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:46,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:46,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:46,934 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:25:46" (1/1) ... [2022-02-20 17:25:46,941 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:25:46" (1/1) ... [2022-02-20 17:25:46,960 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-02-20 17:25:46,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:46,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:46,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:46,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:46,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:46,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:47,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:47,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:47,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:47,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:47,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:47,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (1/1) ... [2022-02-20 17:25:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:47,040 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:25:47,071 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:25:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:25:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:47,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:47,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:47,150 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:47,152 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:47,944 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:47,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:47,950 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:47,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:47 BoogieIcfgContainer [2022-02-20 17:25:47,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:47,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:47,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:47,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:47,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:46" (1/3) ... [2022-02-20 17:25:47,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46aa10b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:47, skipping insertion in model container [2022-02-20 17:25:47,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:46" (2/3) ... [2022-02-20 17:25:47,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46aa10b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:47, skipping insertion in model container [2022-02-20 17:25:47,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:47" (3/3) ... [2022-02-20 17:25:47,970 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound2.c [2022-02-20 17:25:47,974 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:47,975 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:48,030 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:48,047 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:25:48,053 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:25:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:25:48,079 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:48,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:48,080 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:48,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-02-20 17:25:48,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:48,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475698248] [2022-02-20 17:25:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:48,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:48,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:48,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:25:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:25:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:48,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:25:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:48,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:48,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {20#true} is VALID [2022-02-20 17:25:48,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 2.0));main_~r~0#1 := 0bv32; {20#true} is VALID [2022-02-20 17:25:48,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !true; {21#false} is VALID [2022-02-20 17:25:48,633 INFO L272 TraceCheckUtils]: 3: Hoare triple {21#false} call __VERIFIER_assert((if 0bv32 == ~convertDOUBLEToINT(~roundTowardZero, ~fp.add~DOUBLE(currentRoundingMode, ~fp.sub~DOUBLE(currentRoundingMode, ~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, ~bvmul32(main_~r~0#1, main_~r~0#1)), main_~a~0#1), ~convertINTToDOUBLE(currentRoundingMode, main_~r~0#1)), ~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 2bv32), main_~x~0#1))) then 1bv32 else 0bv32)); {21#false} is VALID [2022-02-20 17:25:48,633 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2022-02-20 17:25:48,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2022-02-20 17:25:48,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:25:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:25:48,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:48,635 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:25:48,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475698248] [2022-02-20 17:25:48,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475698248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:48,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:48,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:48,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645126480] [2022-02-20 17:25:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:48,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:25:48,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:48,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:48,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:48,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:48,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:25:48,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:48,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:48,937 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:57,669 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 17:25:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:57,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:25:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:25:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2022-02-20 17:25:57,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2022-02-20 17:25:59,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:59,876 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:25:59,877 INFO L226 Difference]: Without dead ends: 13 [2022-02-20 17:25:59,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:59,882 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:59,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-20 17:25:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-20 17:25:59,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:59,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:59,908 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:59,908 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:59,911 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:25:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:59,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:59,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:59,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:25:59,913 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-02-20 17:25:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:59,915 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 17:25:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:59,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:59,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:59,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:59,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:25:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-20 17:25:59,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-02-20 17:25:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:59,919 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-20 17:25:59,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:25:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-20 17:25:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:25:59,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:59,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:59,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:26:00,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:26:00,140 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:26:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:26:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-02-20 17:26:00,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:26:00,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848148088] [2022-02-20 17:26:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:26:00,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:26:00,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:26:00,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:26:00,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:26:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:26:00,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:26:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:26:00,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:26:00,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(10bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {132#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:26:00,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~r~0#1, main_~a~0#1, main_~x~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~x~0#1;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, main_~a~0#1, ~to_fp~DOUBLE(currentRoundingMode, 2.0));main_~r~0#1 := 0bv32; {132#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:26:00,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {139#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:26:00,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {139#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 2bv32);havoc main_#t~post5#1; {128#false} is VALID [2022-02-20 17:26:00,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#false} call __VERIFIER_assert((if 0bv32 == ~convertDOUBLEToINT(~roundTowardZero, ~fp.add~DOUBLE(currentRoundingMode, ~fp.sub~DOUBLE(currentRoundingMode, ~fp.sub~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, ~bvmul32(main_~r~0#1, main_~r~0#1)), main_~a~0#1), ~convertINTToDOUBLE(currentRoundingMode, main_~r~0#1)), ~fp.mul~DOUBLE(currentRoundingMode, ~convertINTToDOUBLE(currentRoundingMode, 2bv32), main_~x~0#1))) then 1bv32 else 0bv32)); {128#false} is VALID [2022-02-20 17:26:00,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-02-20 17:26:00,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#false} assume 0bv32 == ~cond; {128#false} is VALID [2022-02-20 17:26:00,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-02-20 17:26:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:26:00,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:26:00,578 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:26:00,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848148088] [2022-02-20 17:26:00,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848148088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:26:00,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:26:00,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:26:00,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465680274] [2022-02-20 17:26:00,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:26:00,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:26:00,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:26:00,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:26:00,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:26:00,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:26:00,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:26:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:26:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:26:00,861 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:26:23,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:26:23,970 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-02-20 17:26:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:26:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:26:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:26:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:26:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:26:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:26:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 17:26:23,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 17:26:24,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:26:24,922 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:26:24,922 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:26:24,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:26:24,924 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:26:24,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 17:26:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:26:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:26:24,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:26:24,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:26:24,932 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:26:24,932 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:26:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:26:24,933 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:26:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:26:24,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:26:24,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:26:24,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:26:24,935 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-02-20 17:26:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:26:24,936 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 17:26:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:26:24,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:26:24,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:26:24,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:26:24,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:26:24,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:26:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 17:26:24,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-02-20 17:26:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:26:24,940 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 17:26:24,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:26:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 17:26:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:26:24,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:26:24,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:26:24,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:26:25,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:26:25,143 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:26:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:26:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-02-20 17:26:25,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:26:25,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460900922] [2022-02-20 17:26:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:26:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:26:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:26:25,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:26:25,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:26:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:26:27,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:26:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 17:26:29,949 INFO L286 TraceCheckSpWp]: Computing forward predicates...