./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 fbf6cb56c42d2fc851e723344a93d807d314228d ................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/filter1.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 fbf6cb56c42d2fc851e723344a93d807d314228d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:20:43,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:20:43,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:20:43,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:20:43,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:20:43,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:20:43,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:20:43,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:20:43,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:20:43,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:20:43,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:20:43,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:20:43,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:20:43,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:20:43,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:20:43,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:20:43,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:20:43,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:20:43,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:20:43,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:20:43,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:20:43,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:20:43,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:20:43,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:20:43,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:20:43,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:20:43,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:20:43,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:20:43,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:20:43,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:20:43,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:20:43,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:20:43,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:20:43,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:20:43,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:20:43,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:20:43,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:20:43,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:20:43,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:20:43,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:20:43,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:20:43,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 14:20:43,609 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:20:43,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:20:43,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:20:43,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:20:43,614 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:20:43,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:20:43,614 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:20:43,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 14:20:43,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:20:43,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:20:43,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:20:43,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:20:43,617 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:20:43,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:20:43,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:20:43,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:20:43,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:20:43,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:20:43,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:20:43,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:20:43,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:20:43,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:20:43,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:20:43,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:20:43,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:20:43,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 14:20:43,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 14:20:43,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:20:43,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:20:43,622 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-2/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-2/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 -> fbf6cb56c42d2fc851e723344a93d807d314228d [2020-10-24 14:20:44,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:20:44,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:20:44,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:20:44,043 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:20:44,044 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:20:44,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c [2020-10-24 14:20:44,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dcf81decc/87da01871e444992949e5e0ace254499/FLAGefcb44e71 [2020-10-24 14:20:44,765 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:20:44,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c [2020-10-24 14:20:44,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dcf81decc/87da01871e444992949e5e0ace254499/FLAGefcb44e71 [2020-10-24 14:20:45,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dcf81decc/87da01871e444992949e5e0ace254499 [2020-10-24 14:20:45,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:20:45,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:20:45,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:20:45,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:20:45,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:20:45,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174b8bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45, skipping insertion in model container [2020-10-24 14:20:45,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,151 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:20:45,170 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:20:45,417 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:20:45,427 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:20:45,448 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:20:45,466 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:20:45,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45 WrapperNode [2020-10-24 14:20:45,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:20:45,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:20:45,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:20:45,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:20:45,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:20:45,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:20:45,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:20:45,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:20:45,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... [2020-10-24 14:20:45,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:20:45,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:20:45,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:20:45,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:20:45,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:20:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 14:20:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:20:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:20:45,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:20:46,038 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:20:46,038 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-24 14:20:46,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:46 BoogieIcfgContainer [2020-10-24 14:20:46,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:20:46,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:20:46,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:20:46,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:20:46,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:20:45" (1/3) ... [2020-10-24 14:20:46,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d35792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:20:46, skipping insertion in model container [2020-10-24 14:20:46,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:45" (2/3) ... [2020-10-24 14:20:46,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d35792d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:20:46, skipping insertion in model container [2020-10-24 14:20:46,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:46" (3/3) ... [2020-10-24 14:20:46,050 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c [2020-10-24 14:20:46,066 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:20:46,071 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:20:46,090 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:20:46,145 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:20:46,145 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:20:46,145 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:20:46,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:20:46,146 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:20:46,146 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:20:46,146 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:20:46,146 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:20:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-10-24 14:20:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-24 14:20:46,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:20:46,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:20:46,197 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:20:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:20:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash -332259343, now seen corresponding path program 1 times [2020-10-24 14:20:46,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:20:46,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612835533] [2020-10-24 14:20:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:20:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:20:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:20:46,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612835533] [2020-10-24 14:20:46,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:20:46,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 14:20:46,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271429750] [2020-10-24 14:20:46,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:20:46,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 14:20:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:20:46,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:20:46,488 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2020-10-24 14:20:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:20:46,507 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2020-10-24 14:20:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:20:46,509 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-10-24 14:20:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:20:46,519 INFO L225 Difference]: With dead ends: 29 [2020-10-24 14:20:46,520 INFO L226 Difference]: Without dead ends: 11 [2020-10-24 14:20:46,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:20:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-10-24 14:20:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-24 14:20:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-24 14:20:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-24 14:20:46,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2020-10-24 14:20:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:20:46,573 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-24 14:20:46,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:20:46,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-10-24 14:20:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-24 14:20:46,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:20:46,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:20:46,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 14:20:46,577 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:20:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:20:46,582 INFO L82 PathProgramCache]: Analyzing trace with hash -275001041, now seen corresponding path program 1 times [2020-10-24 14:20:46,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:20:46,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080533277] [2020-10-24 14:20:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:20:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:20:46,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:20:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:20:46,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:20:46,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 14:20:46,750 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 14:20:46,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 14:20:46,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:20:46 BoogieIcfgContainer [2020-10-24 14:20:46,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:20:46,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:20:46,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:20:46,796 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:20:46,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:46" (3/4) ... [2020-10-24 14:20:46,803 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:20:46,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:20:46,810 INFO L168 Benchmark]: Toolchain (without parser) took 1680.79 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.1 MB in the beginning and 30.6 MB in the end (delta: -11.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:20:46,812 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory is still 26.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:20:46,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.37 ms. Allocated memory is still 41.9 MB. Free memory was 18.4 MB in the beginning and 21.8 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-24 14:20:46,816 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 41.9 MB. Free memory was 21.8 MB in the beginning and 20.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:20:46,817 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 41.9 MB. Free memory was 20.3 MB in the beginning and 19.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:20:46,819 INFO L168 Benchmark]: RCFGBuilder took 501.01 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.3 MB in the beginning and 27.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2020-10-24 14:20:46,821 INFO L168 Benchmark]: TraceAbstraction took 752.77 ms. Allocated memory is still 50.3 MB. Free memory was 27.2 MB in the beginning and 30.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-10-24 14:20:46,822 INFO L168 Benchmark]: Witness Printer took 8.53 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 30.6 MB in the end (delta: 267.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:20:46,839 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.26 ms. Allocated memory is still 41.9 MB. Free memory is still 26.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 334.37 ms. Allocated memory is still 41.9 MB. Free memory was 18.4 MB in the beginning and 21.8 MB in the end (delta: -3.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 41.9 MB. Free memory was 21.8 MB in the beginning and 20.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.12 ms. Allocated memory is still 41.9 MB. Free memory was 20.3 MB in the beginning and 19.3 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 501.01 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.3 MB in the beginning and 27.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 752.77 ms. Allocated memory is still 50.3 MB. Free memory was 27.2 MB in the beginning and 30.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Witness Printer took 8.53 ms. Allocated memory is still 50.3 MB. Free memory was 30.9 MB in the beginning and 30.6 MB in the end (delta: 267.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of to_real at line 34, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 41. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L15] COND FALSE !(!cond) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L17] COND TRUE !(cond) [L3] __assert_fail("0", "filter1.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, 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=16occurred in iteration=0, 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:20:49,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:20:49,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:20:49,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:20:49,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:20:49,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:20:49,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:20:49,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:20:49,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:20:49,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:20:49,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:20:49,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:20:49,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:20:49,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:20:49,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:20:49,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:20:49,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:20:49,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:20:49,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:20:49,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:20:49,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:20:49,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:20:49,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:20:49,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:20:49,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:20:49,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:20:49,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:20:49,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:20:49,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:20:49,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:20:49,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:20:49,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:20:49,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:20:49,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:20:49,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:20:49,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:20:49,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:20:49,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:20:49,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:20:49,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:20:49,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:20:49,751 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 14:20:49,802 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:20:49,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:20:49,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:20:49,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:20:49,806 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:20:49,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:20:49,807 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:20:49,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:20:49,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:20:49,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:20:49,809 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:20:49,809 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:20:49,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 14:20:49,810 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 14:20:49,810 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:20:49,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:20:49,810 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:20:49,810 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:20:49,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:20:49,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:20:49,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:20:49,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:20:49,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:20:49,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:20:49,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:20:49,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:20:49,813 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 14:20:49,813 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 14:20:49,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:20:49,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:20:49,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 14:20:49,814 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-2/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-2/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 -> fbf6cb56c42d2fc851e723344a93d807d314228d [2020-10-24 14:20:50,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:20:50,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:20:50,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:20:50,340 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:20:50,341 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:20:50,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c [2020-10-24 14:20:50,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc1a11309/a731c2c3ed194e669f202d68432f64a0/FLAG0f515e4b3 [2020-10-24 14:20:51,158 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:20:51,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c [2020-10-24 14:20:51,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc1a11309/a731c2c3ed194e669f202d68432f64a0/FLAG0f515e4b3 [2020-10-24 14:20:51,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dc1a11309/a731c2c3ed194e669f202d68432f64a0 [2020-10-24 14:20:51,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:20:51,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:20:51,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:20:51,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:20:51,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:20:51,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6715d7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51, skipping insertion in model container [2020-10-24 14:20:51,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,494 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:20:51,518 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:20:51,703 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:20:51,728 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:20:51,758 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:20:51,789 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:20:51,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51 WrapperNode [2020-10-24 14:20:51,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:20:51,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:20:51,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:20:51,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:20:51,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,812 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:20:51,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:20:51,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:20:51,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:20:51,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... [2020-10-24 14:20:51,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:20:51,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:20:51,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:20:51,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:20:51,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:20:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 14:20:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 14:20:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:20:51,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:20:51,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:20:54,504 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:20:54,505 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-24 14:20:54,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:54 BoogieIcfgContainer [2020-10-24 14:20:54,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:20:54,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:20:54,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:20:54,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:20:54,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:20:51" (1/3) ... [2020-10-24 14:20:54,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc69d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:20:54, skipping insertion in model container [2020-10-24 14:20:54,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:20:51" (2/3) ... [2020-10-24 14:20:54,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc69d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:20:54, skipping insertion in model container [2020-10-24 14:20:54,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:54" (3/3) ... [2020-10-24 14:20:54,516 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c [2020-10-24 14:20:54,527 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:20:54,532 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:20:54,546 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:20:54,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:20:54,590 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:20:54,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:20:54,591 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:20:54,591 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:20:54,591 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:20:54,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:20:54,591 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:20:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-10-24 14:20:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 14:20:54,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:20:54,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:20:54,612 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:20:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:20:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1165686489, now seen corresponding path program 1 times [2020-10-24 14:20:54,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:20:54,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152637086] [2020-10-24 14:20:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 14:20:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:20:54,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 14:20:54,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:20:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:20:54,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:20:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:20:54,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152637086] [2020-10-24 14:20:54,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:20:54,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 14:20:54,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908165608] [2020-10-24 14:20:54,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:20:54,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:20:54,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:20:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:20:54,893 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-10-24 14:20:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:20:54,921 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-10-24 14:20:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:20:54,923 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-10-24 14:20:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:20:54,938 INFO L225 Difference]: With dead ends: 39 [2020-10-24 14:20:54,938 INFO L226 Difference]: Without dead ends: 16 [2020-10-24 14:20:54,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:20:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-24 14:20:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-24 14:20:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-24 14:20:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-24 14:20:54,990 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2020-10-24 14:20:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:20:54,991 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-24 14:20:54,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:20:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-10-24 14:20:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 14:20:54,993 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:20:54,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:20:55,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 14:20:55,214 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:20:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:20:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 356339863, now seen corresponding path program 1 times [2020-10-24 14:20:55,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:20:55,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549391614] [2020-10-24 14:20:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 14:20:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:20:55,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-24 14:20:55,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:20:55,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:20:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:20:55,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:20:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:20:55,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549391614] [2020-10-24 14:20:55,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:20:55,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-10-24 14:20:55,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237033427] [2020-10-24 14:20:55,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 14:20:55,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:20:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 14:20:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-24 14:20:55,748 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 7 states. [2020-10-24 14:20:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:20:58,861 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2020-10-24 14:20:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 14:20:58,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-24 14:20:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:20:58,865 INFO L225 Difference]: With dead ends: 60 [2020-10-24 14:20:58,865 INFO L226 Difference]: Without dead ends: 46 [2020-10-24 14:20:58,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-24 14:20:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-24 14:20:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 20. [2020-10-24 14:20:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-24 14:20:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-24 14:20:58,877 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2020-10-24 14:20:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:20:58,877 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-24 14:20:58,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 14:20:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-24 14:20:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 14:20:58,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:20:58,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:20:59,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 14:20:59,084 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:20:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:20:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 413598165, now seen corresponding path program 1 times [2020-10-24 14:20:59,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:20:59,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621159910] [2020-10-24 14:20:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 14:20:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:20:59,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-24 14:20:59,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:20:59,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:00,119 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-10-24 14:21:00,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:00,631 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-10-24 14:21:00,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:01,148 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-24 14:21:01,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:03,888 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-10-24 14:21:08,750 WARN L193 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 77 [2020-10-24 14:21:27,349 WARN L193 SmtUtils]: Spent 12.77 s on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2020-10-24 14:21:27,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:27,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:27,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:21:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:21:27,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:21:46,411 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 68 [2020-10-24 14:21:48,507 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 14:21:48,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:21:48,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:21:50,616 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-10-24 14:21:52,703 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse2)) (not (fp.geq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse1)) (not (= .cse5 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse3 .cse5) (not (= .cse4 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse3))))) (not |c_ULTIMATE.start_main_#t~short14|)) is different from true [2020-10-24 14:21:54,808 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet12_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (v_ULTIMATE.start_main_~E0~0_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet12_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet12_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet12_6|))) (.cse1 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_6|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~E0~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~E0~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~E0~0_8))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= .cse0 .cse1)) (not (fp.geq .cse2 .cse3)) (not (= (fp.neg .cse4) .cse3)) (not (= (fp.add c_~CRM .cse5 .cse2) .cse6)) (not (= .cse1 .cse4)) (not (fp.geq .cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse8 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse5)) (not (= .cse9 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse7 .cse9) (not (fp.leq .cse2 .cse0)) (not (= .cse8 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse7))))) is different from true [2020-10-24 14:21:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:21:55,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621159910] [2020-10-24 14:21:55,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:21:55,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2020-10-24 14:21:55,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029708217] [2020-10-24 14:21:55,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 14:21:55,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:21:55,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 14:21:55,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=171, Unknown=10, NotChecked=124, Total=380 [2020-10-24 14:21:55,151 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 20 states. [2020-10-24 14:22:05,839 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet22_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet23_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet23_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet23_6|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_5|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_14)))) (or (not (= (fp.add c_~CRM .cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0))) .cse1)) (not (fp.geq .cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet22_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet22_6|)))) (not (= (fp.mul c_~CRM .cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) .cse0)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 10000.0))) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0)))) (not (= (fp.sub c_~CRM .cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0))) .cse2))))) (let ((.cse12 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (let ((.cse7 (= roundNearestTiesToEven c_~CRM)) (.cse8 (= .cse12 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E1~0)))) (.cse9 (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse12))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|)))) (and (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= .cse6 (fp.neg .cse5)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse6)))) .cse7 .cse8 .cse9 |c_ULTIMATE.start_main_#t~short14|) (and .cse7 (exists ((|ULTIMATE.start_main_#t~nondet11| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet12| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet12|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet12|))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet11|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet11|)))) (and (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~E0~0) ((_ extract 62 52) c_ULTIMATE.start_main_~E0~0) ((_ extract 51 0) c_ULTIMATE.start_main_~E0~0)) .cse10)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse11) (= .cse10 (fp.neg .cse11))))) .cse8 .cse9 (not |c_ULTIMATE.start_main_#t~short14|)))))) is different from true [2020-10-24 14:22:20,238 WARN L193 SmtUtils]: Spent 10.42 s on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2020-10-24 14:22:22,511 WARN L193 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-10-24 14:22:26,252 WARN L193 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2020-10-24 14:22:33,426 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-10-24 14:22:54,709 WARN L193 SmtUtils]: Spent 5.63 s on a formula simplification that was a NOOP. DAG size: 109 [2020-10-24 14:23:08,925 WARN L193 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 78 [2020-10-24 14:23:20,549 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2020-10-24 14:23:35,704 WARN L193 SmtUtils]: Spent 4.72 s on a formula simplification that was a NOOP. DAG size: 82 [2020-10-24 14:23:40,601 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-10-24 14:23:46,764 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-10-24 14:23:59,931 WARN L193 SmtUtils]: Spent 3.94 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-24 14:24:03,276 WARN L193 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-24 14:25:09,302 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-10-24 14:25:44,876 WARN L193 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-24 14:26:04,418 WARN L193 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 27 [2020-10-24 14:26:10,071 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-10-24 14:26:16,501 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 14:26:19,363 WARN L193 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2020-10-24 14:26:24,982 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-10-24 14:26:32,903 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-24 14:27:37,351 WARN L193 SmtUtils]: Spent 3.41 s on a formula simplification that was a NOOP. DAG size: 80 [2020-10-24 14:28:03,693 WARN L193 SmtUtils]: Spent 4.75 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-24 14:28:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:28:12,197 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2020-10-24 14:28:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-10-24 14:28:12,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 13 [2020-10-24 14:28:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:28:12,199 INFO L225 Difference]: With dead ends: 119 [2020-10-24 14:28:12,200 INFO L226 Difference]: Without dead ends: 101 [2020-10-24 14:28:12,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 197.1s TimeCoverageRelationStatistics Valid=374, Invalid=1172, Unknown=34, NotChecked=400, Total=1980 [2020-10-24 14:28:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-24 14:28:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 26. [2020-10-24 14:28:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-24 14:28:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-10-24 14:28:12,211 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 13 [2020-10-24 14:28:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:28:12,211 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-10-24 14:28:12,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 14:28:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-10-24 14:28:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 14:28:12,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:28:12,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:28:12,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 14:28:12,414 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:28:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:28:12,417 INFO L82 PathProgramCache]: Analyzing trace with hash 20571155, now seen corresponding path program 1 times [2020-10-24 14:28:12,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:28:12,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201714914] [2020-10-24 14:28:12,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-24 14:28:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:28:12,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 14:28:12,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:28:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:28:13,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:28:13,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:28:13,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:28:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:28:13,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201714914] [2020-10-24 14:28:13,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:28:13,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 14:28:13,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702185317] [2020-10-24 14:28:13,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 14:28:13,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:28:13,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 14:28:13,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 14:28:13,070 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2020-10-24 14:28:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:28:13,336 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-10-24 14:28:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 14:28:13,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-24 14:28:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:28:13,337 INFO L225 Difference]: With dead ends: 46 [2020-10-24 14:28:13,337 INFO L226 Difference]: Without dead ends: 26 [2020-10-24 14:28:13,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 14:28:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-24 14:28:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-24 14:28:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-24 14:28:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-10-24 14:28:13,352 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2020-10-24 14:28:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:28:13,355 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-10-24 14:28:13,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 14:28:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-10-24 14:28:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 14:28:13,357 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:28:13,358 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:28:13,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 14:28:13,565 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:28:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:28:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash 593758107, now seen corresponding path program 1 times [2020-10-24 14:28:13,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:28:13,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648651638] [2020-10-24 14:28:13,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-24 14:28:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:28:14,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2020-10-24 14:28:14,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:28:14,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:15,067 WARN L193 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 14:28:15,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:15,975 WARN L193 SmtUtils]: Spent 676.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-10-24 14:28:15,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:19,157 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-24 14:28:19,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:22,165 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2020-10-24 14:28:22,895 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-24 14:28:23,588 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-10-24 14:28:23,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:25,493 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 72 [2020-10-24 14:28:25,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:27,827 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 81 [2020-10-24 14:28:27,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:42,320 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 131 [2020-10-24 14:28:42,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:28:43,632 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-24 14:29:26,380 WARN L193 SmtUtils]: Spent 8.74 s on a formula simplification that was a NOOP. DAG size: 97 [2020-10-24 14:31:17,638 WARN L193 SmtUtils]: Spent 1.20 m on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2020-10-24 14:31:17,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:17,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:17,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:23,875 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_9| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_17 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_9| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_9| (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_9|))) (.cse9 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_17))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_9|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_9|))) (.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse7 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse13 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse12 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse14 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 .cse1) (= .cse1 .cse2) (= .cse3 (fp.sub roundNearestTiesToEven .cse4 .cse5)) (fp.leq .cse6 .cse7) (fp.leq .cse5 .cse2) (= (fp.mul roundNearestTiesToEven .cse8 .cse9) .cse10) (= .cse11 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (fp.geq .cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) .cse8) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse9) (not (fp.leq .cse3 .cse11)) (= .cse12 .cse1) (= .cse4 (fp.add roundNearestTiesToEven .cse10 .cse6)) (= (fp.neg .cse0) .cse13) (= .cse7 .cse1) (fp.geq .cse6 .cse14) (fp.geq .cse5 .cse13) (= (fp.neg .cse12) .cse14)))) (not |c_ULTIMATE.start_main_#t~short24|)) |c_ULTIMATE.start_main_#t~short24|) is different from true [2020-10-24 14:31:23,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:26,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648651638] [2020-10-24 14:31:26,002 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-10-24 14:31:26,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [328059027] [2020-10-24 14:31:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-24 14:31:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:31:27,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-24 14:31:27,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:31:27,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:27,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:27,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:30,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:30,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:31,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:33,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:31:47,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:37,746 WARN L193 SmtUtils]: Spent 8.01 s on a formula simplification that was a NOOP. DAG size: 97 [2020-10-24 14:32:37,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:39,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_18 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_10| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_10|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_18))) (.cse9 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse12 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse16 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse15 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse13 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse10 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse14 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse17 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse18 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse6 (fp.mul c_~CRM .cse7 .cse8)) (= .cse7 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse8) (= .cse9 .cse10) (fp.leq .cse11 .cse9) (fp.leq .cse12 .cse13) (= (fp.sub c_~CRM .cse14 .cse12) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0))) (= (fp.neg .cse15) .cse16) (= .cse17 .cse10) (fp.geq .cse11 .cse18) (fp.geq .cse12 .cse16) (= .cse15 .cse10) (= .cse13 .cse10) (= .cse14 (fp.add c_~CRM .cse6 .cse11)) (= (fp.neg .cse17) .cse18))))) (.cse3 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|))) (.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) (and (= .cse1 (fp.neg .cse2)) (= .cse2 ((_ to_fp 11 53) c_~CRM 10000.0)) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse1)))) .cse3 |c_ULTIMATE.start_main_#t~short24|) (and .cse0 .cse3 (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|)))) (and (= .cse4 (fp.neg .cse5)) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) .cse4)) (= .cse5 ((_ to_fp 11 53) c_~CRM 10000.0))))) (not |c_ULTIMATE.start_main_#t~short24|)))) is different from false [2020-10-24 14:32:39,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:39,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:39,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:45,957 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((|ULTIMATE.start_main_#t~nondet21| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_18 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_10| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet21|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet21|))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse13 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_18))) (.cse2 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse6 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse15 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_10|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse16 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse14 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse11 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse12 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse17 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 (fp.neg .cse1)) (= .cse2 .cse3) (= .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.leq .cse7 .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse8) (= .cse9 .cse10) (fp.geq .cse11 .cse0) (not (fp.leq .cse11 .cse9)) (= .cse1 .cse10) (= .cse12 .cse3) (= (fp.add roundNearestTiesToEven .cse13 .cse5) .cse14) (= .cse13 (fp.mul roundNearestTiesToEven .cse15 .cse8)) (= (fp.neg .cse2) .cse16) (= .cse6 .cse3) (= .cse15 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (fp.geq .cse5 .cse17) (fp.geq .cse7 .cse16) (= (fp.sub roundNearestTiesToEven .cse14 .cse7) .cse11) (= (fp.neg .cse12) .cse17)))) (not |c_ULTIMATE.start_main_#t~short24|)) |c_ULTIMATE.start_main_#t~short24|) is different from true [2020-10-24 14:32:45,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:48,095 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-10-24 14:32:48,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396708456] [2020-10-24 14:32:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 14:32:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:32:51,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2020-10-24 14:32:51,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:32:51,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:51,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:51,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:54,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:54,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:55,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:32:56,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:33:09,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:34:14,498 WARN L193 SmtUtils]: Spent 7.74 s on a formula simplification that was a NOOP. DAG size: 97 [2020-10-24 14:34:16,618 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse1 (exists ((ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_19 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_11| (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse11 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse10 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse8 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse5 ((_ to_fp 11 53) c_~CRM 1.0)) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_19))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|))) (.cse14 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse12 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse13 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= ((_ to_fp 11 53) c_~CRM (_ bv0 32)) .cse2) (= .cse3 ((_ to_fp 11 53) c_~CRM (/ 999.0 1000.0))) (= .cse4 .cse5) (fp.leq .cse6 .cse4) (fp.leq .cse7 .cse8) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp.sub c_~CRM .cse9 .cse7)) (= (fp.neg .cse10) .cse11) (= .cse12 .cse5) (fp.geq .cse6 .cse13) (fp.geq .cse7 .cse11) (= .cse10 .cse5) (= .cse8 .cse5) (= (fp.mul c_~CRM .cse3 .cse2) .cse14) (= .cse9 (fp.add c_~CRM .cse14 .cse6)) (= (fp.neg .cse12) .cse13)))))) (or (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|)))) .cse1 |c_ULTIMATE.start_main_#t~short24|) (and .cse0 (exists ((v_prenex_33 (_ BitVec 64))) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~S~0) ((_ extract 62 52) c_ULTIMATE.start_main_~S~0) ((_ extract 51 0) c_ULTIMATE.start_main_~S~0)) (fp ((_ extract 63 63) v_prenex_33) ((_ extract 62 52) v_prenex_33) ((_ extract 51 0) v_prenex_33))))) .cse1 (not |c_ULTIMATE.start_main_#t~short24|)))) is different from false [2020-10-24 14:34:16,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:34:16,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:34:16,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:34:23,053 WARN L860 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short24| (and (exists ((|ULTIMATE.start_main_#t~nondet22| (_ BitVec 64)) (ULTIMATE.start_main_~S~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet23| (_ BitVec 64)) (ULTIMATE.start_main_~E0~0 (_ BitVec 64)) (ULTIMATE.start_main_~E1~0 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~S~0_19 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet17_11| (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|))) (.cse5 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~S~0) ((_ extract 62 52) ULTIMATE.start_main_~S~0) ((_ extract 51 0) ULTIMATE.start_main_~S~0))) (.cse10 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet23|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet23|))) (.cse3 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse8 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~E0~0) ((_ extract 62 52) ULTIMATE.start_main_~E0~0) ((_ extract 51 0) ULTIMATE.start_main_~E0~0))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~E1~0) ((_ extract 62 52) ULTIMATE.start_main_~E1~0) ((_ extract 51 0) ULTIMATE.start_main_~E1~0))) (.cse13 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet17_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet17_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet17_11|))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~S~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~S~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~S~0_19))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse12 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse14 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (= .cse3 .cse4) (= .cse4 .cse5) (= .cse6 (fp.sub roundNearestTiesToEven .cse0 .cse7)) (fp.leq .cse2 .cse8) (= .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0))) (fp.leq .cse7 .cse5) (= .cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (fp.geq .cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet22|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet22|))) (= ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)) .cse11) (not (fp.leq .cse6 .cse10)) (= .cse12 .cse4) (= (fp.neg .cse3) .cse13) (= .cse8 .cse4) (fp.geq .cse2 .cse14) (fp.geq .cse7 .cse13) (= (fp.mul roundNearestTiesToEven .cse9 .cse11) .cse1) (= (fp.neg .cse12) .cse14)))) (not |c_ULTIMATE.start_main_#t~short24|))) is different from true [2020-10-24 14:34:23,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:34:25,157 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-10-24 14:34:25,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:34:25,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-24 14:34:25,157 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-24 14:34:25,157 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 14:34:25,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 14:34:25,787 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-24 14:34:25,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:34:25 BoogieIcfgContainer [2020-10-24 14:34:25,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:34:25,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:34:25,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:34:25,789 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:34:25,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:20:54" (3/4) ... [2020-10-24 14:34:25,794 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:34:25,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:34:25,797 INFO L168 Benchmark]: Toolchain (without parser) took 814341.12 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 31.0 MB in the beginning and 15.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2020-10-24 14:34:25,797 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 37.7 MB. Free memory is still 18.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:34:25,798 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.08 ms. Allocated memory is still 46.1 MB. Free memory was 30.4 MB in the beginning and 31.0 MB in the end (delta: -553.3 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2020-10-24 14:34:25,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 46.1 MB. Free memory was 31.0 MB in the beginning and 29.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 14:34:25,800 INFO L168 Benchmark]: Boogie Preprocessor took 46.57 ms. Allocated memory is still 46.1 MB. Free memory was 29.3 MB in the beginning and 28.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:34:25,801 INFO L168 Benchmark]: RCFGBuilder took 2620.85 ms. Allocated memory is still 46.1 MB. Free memory was 27.8 MB in the beginning and 23.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. [2020-10-24 14:34:25,802 INFO L168 Benchmark]: TraceAbstraction took 811279.68 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.8 MB in the beginning and 15.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2020-10-24 14:34:25,802 INFO L168 Benchmark]: Witness Printer took 6.01 ms. Allocated memory is still 58.7 MB. Free memory is still 15.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:34:25,807 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.13 ms. Allocated memory is still 37.7 MB. Free memory is still 18.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.08 ms. Allocated memory is still 46.1 MB. Free memory was 30.4 MB in the beginning and 31.0 MB in the end (delta: -553.3 kB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.25 ms. Allocated memory is still 46.1 MB. Free memory was 31.0 MB in the beginning and 29.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.57 ms. Allocated memory is still 46.1 MB. Free memory was 29.3 MB in the beginning and 28.0 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2620.85 ms. Allocated memory is still 46.1 MB. Free memory was 27.8 MB in the beginning and 23.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 811279.68 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.8 MB in the beginning and 15.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. * Witness Printer took 6.01 ms. Allocated memory is still 58.7 MB. Free memory is still 15.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L22] double E0, E1, S; [L23] int i; [L25] E1 = 0 [L26] S = 0 [L28] i = 0 [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] EXPR 1. [L31] EXPR -1. [L31] E0 >= -1. && E0 <= 1. [L31] EXPR 1. [L31] E0 >= -1. && E0 <= 1. [L15] COND FALSE !(!cond) [L33] COND TRUE __VERIFIER_nondet_int() [L34] S = 0 [L39] E1 = E0 [L41] EXPR 10000. [L41] EXPR -10000. [L41] S >= -10000. && S <= 10000. [L41] EXPR 10000. [L41] S >= -10000. && S <= 10000. [L17] COND FALSE !(!(cond)) [L28] i++ [L28] COND TRUE i <= 1000000 [L30] E0 = __VERIFIER_nondet_double() [L31] EXPR 1. [L31] EXPR -1. [L31] E0 >= -1. && E0 <= 1. [L31] EXPR 1. [L31] E0 >= -1. && E0 <= 1. [L15] COND FALSE !(!cond) [L33] COND FALSE !(__VERIFIER_nondet_int()) [L37] EXPR 0.999 [L37] EXPR 0.999 * S [L37] EXPR 0.999 * S + E0 [L37] EXPR 0.999 * S + E0 - E1 [L37] S = 0.999 * S + E0 - E1 [L39] E1 = E0 [L41] EXPR 10000. [L41] EXPR -10000. [L41] S >= -10000. && S <= 10000. [L41] EXPR 10000. [L41] S >= -10000. && S <= 10000. [L17] COND TRUE !(cond) [L3] __assert_fail("0", "filter1.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 811.1s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 380.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 72 SDtfs, 182 SDslu, 248 SDs, 0 SdLazy, 315 SolverSat, 64 SolverUnsat, 93 SolverUnknown, 0 SolverNotchecked, 231.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 197.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, 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, 4 MinimizatonAttempts, 101 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 56.1s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 17 QuantifiedInterpolants, 27504 SizeOfPredicates, 24 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...