./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_valuebound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:35:24,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:35:24,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:35:24,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:35:24,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:35:24,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:35:24,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:35:24,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:35:24,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:35:24,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:35:24,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:35:24,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:35:24,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:35:24,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:35:24,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:35:24,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:35:24,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:35:24,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:35:24,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:35:24,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:35:24,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:35:24,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:35:24,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:35:24,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:35:24,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:35:24,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:35:24,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:35:24,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:35:24,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:35:24,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:35:24,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:35:24,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:35:24,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:35:24,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:35:24,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:35:24,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:35:24,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:35:24,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:35:24,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:35:24,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:35:24,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:35:24,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:35:24,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 03:35:24,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:35:24,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:35:24,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:35:24,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:35:24,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:35:24,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:35:24,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:35:24,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:35:24,773 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:35:24,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:35:24,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:35:24,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 03:35:24,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:35:24,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:35:24,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:35:24,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:35:24,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:35:24,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:35:24,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:35:24,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:24,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:35:24,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:35:24,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:35:24,777 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2022-07-21 03:35:25,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:35:25,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:35:25,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:35:25,065 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:35:25,065 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:35:25,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-07-21 03:35:25,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b62e4952/07bff40be54144188c88717ff08f15a0/FLAGb59626961 [2022-07-21 03:35:25,461 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:35:25,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-07-21 03:35:25,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b62e4952/07bff40be54144188c88717ff08f15a0/FLAGb59626961 [2022-07-21 03:35:25,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b62e4952/07bff40be54144188c88717ff08f15a0 [2022-07-21 03:35:25,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:35:25,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:35:25,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:25,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:35:25,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:35:25,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:25" (1/1) ... [2022-07-21 03:35:25,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7824f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:25, skipping insertion in model container [2022-07-21 03:35:25,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:25" (1/1) ... [2022-07-21 03:35:25,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:35:25,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:35:26,010 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_valuebound50.c[712,725] [2022-07-21 03:35:26,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:26,023 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:35:26,030 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_valuebound50.c[712,725] [2022-07-21 03:35:26,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:26,069 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:35:26,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26 WrapperNode [2022-07-21 03:35:26,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:26,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:26,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:35:26,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:35:26,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,093 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-07-21 03:35:26,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:26,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:35:26,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:35:26,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:35:26,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:35:26,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:35:26,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:35:26,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:35:26,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (1/1) ... [2022-07-21 03:35:26,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:26,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:35:26,148 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-07-21 03:35:26,183 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-07-21 03:35:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:35:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 03:35:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:35:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:35:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:35:26,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:35:26,242 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:35:26,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:35:26,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:35:26,354 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:35:26,359 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:35:26,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:26 BoogieIcfgContainer [2022-07-21 03:35:26,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:35:26,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:35:26,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:35:26,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:35:26,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:35:25" (1/3) ... [2022-07-21 03:35:26,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d835335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:26, skipping insertion in model container [2022-07-21 03:35:26,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:26" (2/3) ... [2022-07-21 03:35:26,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d835335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:26, skipping insertion in model container [2022-07-21 03:35:26,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:26" (3/3) ... [2022-07-21 03:35:26,366 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2022-07-21 03:35:26,377 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:35:26,377 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:35:26,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:35:26,429 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75787947, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18a44930 [2022-07-21 03:35:26,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:35:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07-21 03:35:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:26,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:26,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:26,446 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-21 03:35:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:35:26,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192647999] [2022-07-21 03:35:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:26,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:35:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:35:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 03:35:26,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192647999] [2022-07-21 03:35:26,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192647999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:35:26,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:35:26,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:35:26,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999906263] [2022-07-21 03:35:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:35:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:35:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 03:35:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:35:26,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:26,580 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-21 03:35:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:35:26,593 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-21 03:35:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:35:26,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-07-21 03:35:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:35:26,602 INFO L225 Difference]: With dead ends: 33 [2022-07-21 03:35:26,602 INFO L226 Difference]: Without dead ends: 14 [2022-07-21 03:35:26,605 INFO L412 NwaCegarLoop]: 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-07-21 03:35:26,607 INFO L413 NwaCegarLoop]: 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-07-21 03:35:26,608 INFO L414 NwaCegarLoop]: 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-07-21 03:35:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-21 03:35:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-21 03:35:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 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-07-21 03:35:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-21 03:35:26,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-21 03:35:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:35:26,631 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-21 03:35:26,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-21 03:35:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-21 03:35:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:26,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:26,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:26,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 03:35:26,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-21 03:35:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 03:35:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997095313] [2022-07-21 03:35:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 03:35:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:35:26,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 03:35:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 03:35:26,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 03:35:26,708 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 03:35:26,709 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 03:35:26,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 03:35:26,715 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-21 03:35:26,717 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 03:35:26,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 03:35:26 BoogieIcfgContainer [2022-07-21 03:35:26,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 03:35:26,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 03:35:26,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 03:35:26,736 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 03:35:26,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:26" (3/4) ... [2022-07-21 03:35:26,739 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 03:35:26,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 03:35:26,740 INFO L158 Benchmark]: Toolchain (without parser) took 828.32ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.6MB in the beginning and 43.1MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:26,741 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:26,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.35ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.4MB in the beginning and 47.0MB in the end (delta: -17.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-21 03:35:26,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.04ms. Allocated memory is still 62.9MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:26,744 INFO L158 Benchmark]: Boogie Preprocessor took 28.87ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 44.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 03:35:26,745 INFO L158 Benchmark]: RCFGBuilder took 236.81ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 35.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 03:35:26,746 INFO L158 Benchmark]: TraceAbstraction took 373.53ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 43.5MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 03:35:26,746 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.1MB in the end (delta: 392.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 03:35:26,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 34.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.35ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.4MB in the beginning and 47.0MB in the end (delta: -17.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.04ms. Allocated memory is still 62.9MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.87ms. Allocated memory is still 62.9MB. Free memory was 45.4MB in the beginning and 44.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.81ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 35.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 373.53ms. Allocated memory is still 62.9MB. Free memory was 35.0MB in the beginning and 43.5MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.1MB in the end (delta: 392.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=50) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=50) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-21 03:35:26,785 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 -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_valuebound50.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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 03:35:28,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 03:35:28,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 03:35:28,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 03:35:28,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 03:35:28,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 03:35:28,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 03:35:28,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 03:35:28,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 03:35:28,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 03:35:28,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 03:35:28,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 03:35:28,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 03:35:28,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 03:35:28,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 03:35:28,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 03:35:28,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 03:35:28,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 03:35:28,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 03:35:28,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 03:35:28,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 03:35:28,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 03:35:28,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 03:35:28,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 03:35:28,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 03:35:28,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 03:35:28,335 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 03:35:28,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 03:35:28,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 03:35:28,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 03:35:28,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 03:35:28,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 03:35:28,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 03:35:28,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 03:35:28,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 03:35:28,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 03:35:28,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 03:35:28,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 03:35:28,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 03:35:28,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 03:35:28,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 03:35:28,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 03:35:28,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 03:35:28,374 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 03:35:28,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 03:35:28,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 03:35:28,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 03:35:28,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 03:35:28,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 03:35:28,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 03:35:28,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 03:35:28,377 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 03:35:28,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 03:35:28,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 03:35:28,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 03:35:28,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 03:35:28,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 03:35:28,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 03:35:28,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 03:35:28,379 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 03:35:28,379 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 03:35:28,379 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 03:35:28,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 03:35:28,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 03:35:28,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 03:35:28,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 03:35:28,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 03:35:28,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 03:35:28,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 03:35:28,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:28,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 03:35:28,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 03:35:28,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 03:35:28,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 03:35:28,383 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2022-07-21 03:35:28,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 03:35:28,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 03:35:28,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 03:35:28,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 03:35:28,663 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 03:35:28,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-07-21 03:35:28,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35022a0/e7f770aa44304bc89af1669b0cbc7bc2/FLAG12c9bd8b1 [2022-07-21 03:35:29,095 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 03:35:29,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2022-07-21 03:35:29,100 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35022a0/e7f770aa44304bc89af1669b0cbc7bc2/FLAG12c9bd8b1 [2022-07-21 03:35:29,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce35022a0/e7f770aa44304bc89af1669b0cbc7bc2 [2022-07-21 03:35:29,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 03:35:29,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 03:35:29,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:29,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 03:35:29,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 03:35:29,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199248a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29, skipping insertion in model container [2022-07-21 03:35:29,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 03:35:29,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 03:35:29,260 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_valuebound50.c[712,725] [2022-07-21 03:35:29,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:29,280 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 03:35:29,309 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_valuebound50.c[712,725] [2022-07-21 03:35:29,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 03:35:29,322 INFO L208 MainTranslator]: Completed translation [2022-07-21 03:35:29,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29 WrapperNode [2022-07-21 03:35:29,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 03:35:29,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:29,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 03:35:29,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 03:35:29,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,363 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-07-21 03:35:29,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 03:35:29,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 03:35:29,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 03:35:29,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 03:35:29,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 03:35:29,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 03:35:29,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 03:35:29,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 03:35:29,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (1/1) ... [2022-07-21 03:35:29,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 03:35:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 03:35:29,421 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-07-21 03:35:29,427 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-07-21 03:35:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 03:35:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 03:35:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 03:35:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 03:35:29,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-21 03:35:29,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-21 03:35:29,489 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 03:35:29,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 03:35:30,102 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 03:35:30,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 03:35:30,106 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 03:35:30,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:30 BoogieIcfgContainer [2022-07-21 03:35:30,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 03:35:30,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 03:35:30,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 03:35:30,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 03:35:30,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:35:29" (1/3) ... [2022-07-21 03:35:30,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74753941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:30, skipping insertion in model container [2022-07-21 03:35:30,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:35:29" (2/3) ... [2022-07-21 03:35:30,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74753941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:35:30, skipping insertion in model container [2022-07-21 03:35:30,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:35:30" (3/3) ... [2022-07-21 03:35:30,112 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2022-07-21 03:35:30,122 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 03:35:30,122 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 03:35:30,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 03:35:30,156 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49a1584d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71ddbaf8 [2022-07-21 03:35:30,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 03:35:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-07-21 03:35:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:30,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:30,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:30,164 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-21 03:35:30,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:35:30,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730472570] [2022-07-21 03:35:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:35:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:35:30,177 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-07-21 03:35:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 03:35:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:30,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-21 03:35:30,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:35:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:35:30,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:35:30,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:35:30,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730472570] [2022-07-21 03:35:30,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730472570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:35:30,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:35:30,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 03:35:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405307276] [2022-07-21 03:35:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:35:30,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 03:35:30,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:35:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 03:35:30,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:30,484 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-21 03:35:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:35:30,494 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-21 03:35:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 03:35:30,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-07-21 03:35:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:35:30,499 INFO L225 Difference]: With dead ends: 33 [2022-07-21 03:35:30,499 INFO L226 Difference]: Without dead ends: 14 [2022-07-21 03:35:30,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 03:35:30,503 INFO L413 NwaCegarLoop]: 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-07-21 03:35:30,504 INFO L414 NwaCegarLoop]: 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-07-21 03:35:30,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-21 03:35:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-21 03:35:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 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-07-21 03:35:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-21 03:35:30,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-21 03:35:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:35:30,523 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-21 03:35:30,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-07-21 03:35:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-21 03:35:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 03:35:30,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:35:30,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:35:30,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 03:35:30,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:35:30,740 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:35:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:35:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-21 03:35:30,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:35:30,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176352520] [2022-07-21 03:35:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:35:30,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:35:30,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:35:30,743 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-07-21 03:35:30,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 03:35:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:35:31,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 03:35:31,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:36:39,011 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2022-07-21 03:37:30,032 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) .cse1) (and (not .cse1) (= (_ bv0 32) c___VERIFIER_assert_~cond))))))) is different from false [2022-07-21 03:37:32,074 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (= (_ bv1 32) c___VERIFIER_assert_~cond) .cse1) (and (not .cse1) (= (_ bv0 32) c___VERIFIER_assert_~cond))))))) is different from true [2022-07-21 03:37:47,759 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from false [2022-07-21 03:37:49,800 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2022-07-21 03:37:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 03:37:49,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 03:37:49,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:37:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176352520] [2022-07-21 03:37:49,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176352520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 03:37:49,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 03:37:49,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 03:37:49,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877397017] [2022-07-21 03:37:49,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 03:37:49,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 03:37:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:37:49,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 03:37:49,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=18, Unknown=5, NotChecked=30, Total=72 [2022-07-21 03:37:49,804 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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-07-21 03:37:51,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:01,398 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 03:38:03,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:05,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:07,763 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-21 03:38:10,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:11,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:13,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:38:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:38:13,776 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-07-21 03:38:13,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 03:38:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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 9 [2022-07-21 03:38:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:38:13,836 INFO L225 Difference]: With dead ends: 22 [2022-07-21 03:38:13,836 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 03:38:13,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=33, Invalid=33, Unknown=6, NotChecked=60, Total=132 [2022-07-21 03:38:13,837 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-21 03:38:13,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 9 Invalid, 4 Unknown, 39 Unchecked, 11.4s Time] [2022-07-21 03:38:13,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 03:38:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-21 03:38:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 03:38:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-21 03:38:13,841 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-07-21 03:38:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:38:13,841 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-21 03:38:13,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 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-07-21 03:38:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-21 03:38:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 03:38:13,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:38:13,842 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:38:13,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 03:38:14,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:38:14,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:38:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:38:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2022-07-21 03:38:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:38:14,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731567304] [2022-07-21 03:38:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:38:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:38:14,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:38:14,045 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-07-21 03:38:14,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 03:38:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:38:14,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 03:38:14,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 03:38:20,566 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-21 03:38:22,628 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-21 03:38:35,023 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-21 03:38:43,330 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-21 03:38:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 03:38:43,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 03:39:08,212 WARN L233 SmtUtils]: Spent 16.50s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-21 03:39:24,683 WARN L233 SmtUtils]: Spent 16.47s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-21 03:39:30,913 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-21 03:39:41,286 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-21 03:39:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 03:39:41,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 03:39:41,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731567304] [2022-07-21 03:39:41,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731567304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 03:39:41,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 03:39:41,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-21 03:39:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541192165] [2022-07-21 03:39:41,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 03:39:41,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 03:39:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 03:39:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 03:39:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-21 03:39:41,292 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:39:43,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:39:45,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 03:39:47,590 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-21 03:39:49,659 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-21 03:39:51,728 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-21 03:39:53,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-21 03:39:55,858 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-21 03:39:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 03:39:55,860 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-21 03:39:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 03:39:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2022-07-21 03:39:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 03:39:55,861 INFO L225 Difference]: With dead ends: 22 [2022-07-21 03:39:55,862 INFO L226 Difference]: Without dead ends: 17 [2022-07-21 03:39:55,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-21 03:39:55,863 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 03:39:55,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 44 Unchecked, 4.2s Time] [2022-07-21 03:39:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-21 03:39:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-21 03:39:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 03:39:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-07-21 03:39:55,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-07-21 03:39:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 03:39:55,866 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-07-21 03:39:55,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 03:39:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-07-21 03:39:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 03:39:55,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 03:39:55,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 03:39:55,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 03:39:56,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 03:39:56,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 03:39:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 03:39:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-07-21 03:39:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 03:39:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431007989] [2022-07-21 03:39:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 03:39:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 03:39:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 03:39:56,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 03:39:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 03:39:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 03:39:58,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 03:39:58,205 INFO L286 TraceCheckSpWp]: Computing forward predicates...