./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e04f2515dd5c7ce697460622800d33932bf1903 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e04f2515dd5c7ce697460622800d33932bf1903 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:20,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:20,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:20,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:20,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:20,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:20,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:20,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:20,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:20,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:20,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:20,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:20,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:20,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:20,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:20,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:20,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:20,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:20,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:20,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:20,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:20,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:20,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:20,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:20,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:20,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:20,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:20,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:20,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:20,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:20,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:20,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:20,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:20,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:20,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:20,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:20,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:20,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:20,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:20,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:20,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:20,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:20,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:20,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:20,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:20,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:20,667 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:20,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:20,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:20,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:20,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:20,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:20,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:20,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:20,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:20,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:20,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:20,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:20,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:20,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:20,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:20,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:20,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:20,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:20,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:20,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:20,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:20,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:20,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:20,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:20,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-27 22:34:20,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:21,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:21,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:21,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:21,019 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:21,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-27 22:34:21,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eaa504db/b8277094dc3e40cc9d7c4b416ad35591/FLAGfa80f1e88 [2019-11-27 22:34:21,606 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:21,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-27 22:34:21,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eaa504db/b8277094dc3e40cc9d7c4b416ad35591/FLAGfa80f1e88 [2019-11-27 22:34:21,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eaa504db/b8277094dc3e40cc9d7c4b416ad35591 [2019-11-27 22:34:21,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:21,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:21,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:21,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:21,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:21,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:21" (1/1) ... [2019-11-27 22:34:21,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b07f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:21, skipping insertion in model container [2019-11-27 22:34:21,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:21" (1/1) ... [2019-11-27 22:34:21,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:22,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:22,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:22,296 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:22,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:22,434 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22 WrapperNode [2019-11-27 22:34:22,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:22,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:22,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:22,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:22,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:22,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:22,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:22,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:22,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... [2019-11-27 22:34:22,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:22,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:22,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:22,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:22,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:22,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:22,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:23,214 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:23,215 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 22:34:23,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:23 BoogieIcfgContainer [2019-11-27 22:34:23,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:23,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:23,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:23,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:23,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:21" (1/3) ... [2019-11-27 22:34:23,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df7fb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:23, skipping insertion in model container [2019-11-27 22:34:23,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:22" (2/3) ... [2019-11-27 22:34:23,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df7fb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:23, skipping insertion in model container [2019-11-27 22:34:23,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:23" (3/3) ... [2019-11-27 22:34:23,230 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-27 22:34:23,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:23,249 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-27 22:34:23,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-27 22:34:23,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:23,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:23,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:23,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:23,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:23,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:23,288 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:23,288 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-11-27 22:34:23,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:34:23,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:23,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:23,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:23,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:23,319 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-27 22:34:23,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:23,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602533930] [2019-11-27 22:34:23,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:23,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602533930] [2019-11-27 22:34:23,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:23,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:23,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897413177] [2019-11-27 22:34:23,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:23,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:23,711 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 8 states. [2019-11-27 22:34:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:25,378 INFO L93 Difference]: Finished difference Result 454 states and 688 transitions. [2019-11-27 22:34:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 22:34:25,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-27 22:34:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:25,412 INFO L225 Difference]: With dead ends: 454 [2019-11-27 22:34:25,413 INFO L226 Difference]: Without dead ends: 337 [2019-11-27 22:34:25,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:34:25,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-27 22:34:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 133. [2019-11-27 22:34:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-27 22:34:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2019-11-27 22:34:25,523 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 17 [2019-11-27 22:34:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:25,524 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2019-11-27 22:34:25,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2019-11-27 22:34:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:34:25,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:25,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:25,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:25,528 INFO L82 PathProgramCache]: Analyzing trace with hash 934676335, now seen corresponding path program 1 times [2019-11-27 22:34:25,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:25,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450105371] [2019-11-27 22:34:25,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:25,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450105371] [2019-11-27 22:34:25,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:25,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 22:34:25,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797274595] [2019-11-27 22:34:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:25,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:25,763 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 7 states. [2019-11-27 22:34:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,051 INFO L93 Difference]: Finished difference Result 288 states and 410 transitions. [2019-11-27 22:34:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:26,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-27 22:34:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,054 INFO L225 Difference]: With dead ends: 288 [2019-11-27 22:34:26,054 INFO L226 Difference]: Without dead ends: 204 [2019-11-27 22:34:26,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:34:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-27 22:34:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-11-27 22:34:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-27 22:34:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 274 transitions. [2019-11-27 22:34:26,075 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 274 transitions. Word has length 17 [2019-11-27 22:34:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,076 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 274 transitions. [2019-11-27 22:34:26,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 274 transitions. [2019-11-27 22:34:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:34:26,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:26,078 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1341099622, now seen corresponding path program 1 times [2019-11-27 22:34:26,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460086836] [2019-11-27 22:34:26,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:26,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460086836] [2019-11-27 22:34:26,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:26,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695079482] [2019-11-27 22:34:26,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:26,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:26,295 INFO L87 Difference]: Start difference. First operand 193 states and 274 transitions. Second operand 8 states. [2019-11-27 22:34:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,689 INFO L93 Difference]: Finished difference Result 304 states and 404 transitions. [2019-11-27 22:34:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 22:34:26,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-27 22:34:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,693 INFO L225 Difference]: With dead ends: 304 [2019-11-27 22:34:26,693 INFO L226 Difference]: Without dead ends: 256 [2019-11-27 22:34:26,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-27 22:34:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-27 22:34:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2019-11-27 22:34:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-27 22:34:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2019-11-27 22:34:26,725 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 21 [2019-11-27 22:34:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,726 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2019-11-27 22:34:26,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2019-11-27 22:34:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:34:26,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:26,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1901024439, now seen corresponding path program 1 times [2019-11-27 22:34:26,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768048182] [2019-11-27 22:34:26,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:26,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768048182] [2019-11-27 22:34:26,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:26,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:26,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588780999] [2019-11-27 22:34:26,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:26,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,808 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 3 states. [2019-11-27 22:34:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:26,841 INFO L93 Difference]: Finished difference Result 336 states and 472 transitions. [2019-11-27 22:34:26,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:26,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-27 22:34:26,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:26,845 INFO L225 Difference]: With dead ends: 336 [2019-11-27 22:34:26,845 INFO L226 Difference]: Without dead ends: 261 [2019-11-27 22:34:26,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-27 22:34:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 232. [2019-11-27 22:34:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-27 22:34:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 321 transitions. [2019-11-27 22:34:26,868 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 321 transitions. Word has length 25 [2019-11-27 22:34:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:26,869 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 321 transitions. [2019-11-27 22:34:26,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 321 transitions. [2019-11-27 22:34:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:34:26,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:26,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:26,882 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 186737553, now seen corresponding path program 1 times [2019-11-27 22:34:26,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:26,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521036484] [2019-11-27 22:34:26,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:27,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521036484] [2019-11-27 22:34:27,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:27,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:34:27,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094710484] [2019-11-27 22:34:27,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:27,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:27,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:27,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:27,045 INFO L87 Difference]: Start difference. First operand 232 states and 321 transitions. Second operand 6 states. [2019-11-27 22:34:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:27,235 INFO L93 Difference]: Finished difference Result 358 states and 490 transitions. [2019-11-27 22:34:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:27,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-27 22:34:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:27,237 INFO L225 Difference]: With dead ends: 358 [2019-11-27 22:34:27,237 INFO L226 Difference]: Without dead ends: 193 [2019-11-27 22:34:27,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-27 22:34:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2019-11-27 22:34:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-27 22:34:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2019-11-27 22:34:27,251 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 25 [2019-11-27 22:34:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,252 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2019-11-27 22:34:27,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2019-11-27 22:34:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:27,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:27,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:27,254 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash -873114857, now seen corresponding path program 1 times [2019-11-27 22:34:27,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929706102] [2019-11-27 22:34:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:27,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929706102] [2019-11-27 22:34:27,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:27,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:34:27,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193504811] [2019-11-27 22:34:27,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:27,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:27,296 INFO L87 Difference]: Start difference. First operand 182 states and 248 transitions. Second operand 5 states. [2019-11-27 22:34:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:27,391 INFO L93 Difference]: Finished difference Result 313 states and 430 transitions. [2019-11-27 22:34:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:27,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-27 22:34:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:27,393 INFO L225 Difference]: With dead ends: 313 [2019-11-27 22:34:27,393 INFO L226 Difference]: Without dead ends: 238 [2019-11-27 22:34:27,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-27 22:34:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-11-27 22:34:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-27 22:34:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2019-11-27 22:34:27,406 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 29 [2019-11-27 22:34:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:27,407 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2019-11-27 22:34:27,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2019-11-27 22:34:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:27,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:27,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:27,408 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-27 22:34:27,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:27,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678648944] [2019-11-27 22:34:27,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:27,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:34:27,587 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:27,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:27 BoogieIcfgContainer [2019-11-27 22:34:27,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:27,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:27,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:27,629 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:27,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:23" (3/4) ... [2019-11-27 22:34:27,634 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 22:34:27,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:27,638 INFO L168 Benchmark]: Toolchain (without parser) took 5679.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:27,639 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:27,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:27,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:27,641 INFO L168 Benchmark]: Boogie Preprocessor took 55.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:27,642 INFO L168 Benchmark]: RCFGBuilder took 658.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:27,643 INFO L168 Benchmark]: TraceAbstraction took 4408.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:27,644 INFO L168 Benchmark]: Witness Printer took 6.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:27,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 658.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4408.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) [L6] COND TRUE !(cond) [L7] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 6 error locations. Result: UNSAFE, OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 680 SDtfs, 2059 SDslu, 2424 SDs, 0 SdLazy, 601 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 377 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 12000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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.1.24-30f4e4a [2019-11-27 22:34:29,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:29,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:29,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:29,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:29,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:29,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:29,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:29,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:29,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:29,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:29,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:29,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:29,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:29,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:29,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:29,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:29,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:29,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:29,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:29,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:29,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:29,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:29,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:29,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:29,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:29,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:29,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:29,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:29,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:29,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:29,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:29,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:29,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:29,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:29,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:29,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:29,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:29,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:29,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:29,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:29,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:34:29,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:29,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:29,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:29,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:29,791 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:29,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:29,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:29,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:29,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:29,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:29,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:29,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:29,794 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:34:29,795 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:34:29,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:29,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:29,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:29,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:29,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:29,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:29,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:29,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:29,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:29,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:29,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:29,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:29,799 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:34:29,799 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:34:29,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:29,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:34:29,800 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-27 22:34:30,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:30,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:30,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:30,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:30,130 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:30,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-27 22:34:30,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50ec06dc/72546e2e59d041eab3bf3fda1035a192/FLAG7cb0513e5 [2019-11-27 22:34:30,753 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:30,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-27 22:34:30,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50ec06dc/72546e2e59d041eab3bf3fda1035a192/FLAG7cb0513e5 [2019-11-27 22:34:31,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f50ec06dc/72546e2e59d041eab3bf3fda1035a192 [2019-11-27 22:34:31,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:31,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:31,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:31,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:31,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:31,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2cbe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31, skipping insertion in model container [2019-11-27 22:34:31,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:31,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:31,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:31,389 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:31,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:31,524 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:31,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31 WrapperNode [2019-11-27 22:34:31,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:31,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:31,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:31,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:31,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:31,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:31,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:31,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:31,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... [2019-11-27 22:34:31,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:31,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:31,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:31,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:31,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:31,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:32,269 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:32,269 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 22:34:32,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:32 BoogieIcfgContainer [2019-11-27 22:34:32,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:32,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:32,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:32,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:32,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:31" (1/3) ... [2019-11-27 22:34:32,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc23f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:32, skipping insertion in model container [2019-11-27 22:34:32,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:31" (2/3) ... [2019-11-27 22:34:32,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc23f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:32, skipping insertion in model container [2019-11-27 22:34:32,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:32" (3/3) ... [2019-11-27 22:34:32,280 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-27 22:34:32,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:32,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-27 22:34:32,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-27 22:34:32,331 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:32,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:32,332 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:32,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:32,332 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:32,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:32,333 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:32,333 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2019-11-27 22:34:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 22:34:32,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:32,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:32,358 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 934616753, now seen corresponding path program 1 times [2019-11-27 22:34:32,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:32,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125354794] [2019-11-27 22:34:32,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:32,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:32,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:32,527 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:32,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125354794] [2019-11-27 22:34:32,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:32,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 22:34:32,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199162449] [2019-11-27 22:34:32,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:32,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:32,587 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2019-11-27 22:34:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:32,860 INFO L93 Difference]: Finished difference Result 396 states and 606 transitions. [2019-11-27 22:34:32,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:34:32,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-27 22:34:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:32,880 INFO L225 Difference]: With dead ends: 396 [2019-11-27 22:34:32,880 INFO L226 Difference]: Without dead ends: 294 [2019-11-27 22:34:32,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-27 22:34:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 119. [2019-11-27 22:34:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-27 22:34:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2019-11-27 22:34:32,948 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 17 [2019-11-27 22:34:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:32,948 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2019-11-27 22:34:32,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2019-11-27 22:34:32,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:34:32,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:32,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:33,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:34:33,159 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1603282001, now seen corresponding path program 1 times [2019-11-27 22:34:33,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:33,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183165190] [2019-11-27 22:34:33,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:33,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:33,266 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:33,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183165190] [2019-11-27 22:34:33,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 22:34:33,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114464645] [2019-11-27 22:34:33,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:33,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:33,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:33,293 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand 5 states. [2019-11-27 22:34:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:33,543 INFO L93 Difference]: Finished difference Result 393 states and 542 transitions. [2019-11-27 22:34:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:34:33,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-27 22:34:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:33,548 INFO L225 Difference]: With dead ends: 393 [2019-11-27 22:34:33,548 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 22:34:33,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 22:34:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 185. [2019-11-27 22:34:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-27 22:34:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 268 transitions. [2019-11-27 22:34:33,600 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 268 transitions. Word has length 21 [2019-11-27 22:34:33,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:33,601 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 268 transitions. [2019-11-27 22:34:33,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 268 transitions. [2019-11-27 22:34:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:34:33,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:33,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:33,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:34:33,825 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:33,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1210254991, now seen corresponding path program 1 times [2019-11-27 22:34:33,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:33,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045529274] [2019-11-27 22:34:33,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:33,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:33,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:33,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:33,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045529274] [2019-11-27 22:34:33,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:33,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 22:34:33,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386335610] [2019-11-27 22:34:33,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:33,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:33,924 INFO L87 Difference]: Start difference. First operand 185 states and 268 transitions. Second operand 5 states. [2019-11-27 22:34:34,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:34,097 INFO L93 Difference]: Finished difference Result 377 states and 534 transitions. [2019-11-27 22:34:34,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:34,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-27 22:34:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:34,100 INFO L225 Difference]: With dead ends: 377 [2019-11-27 22:34:34,100 INFO L226 Difference]: Without dead ends: 294 [2019-11-27 22:34:34,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-27 22:34:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2019-11-27 22:34:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-27 22:34:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 400 transitions. [2019-11-27 22:34:34,126 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 400 transitions. Word has length 21 [2019-11-27 22:34:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,126 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 400 transitions. [2019-11-27 22:34:34,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 400 transitions. [2019-11-27 22:34:34,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:34:34,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:34,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:34:34,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1309704943, now seen corresponding path program 1 times [2019-11-27 22:34:34,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:34,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221971529] [2019-11-27 22:34:34,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:34,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:34:34,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:34,439 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:34,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221971529] [2019-11-27 22:34:34,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:34,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-27 22:34:34,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436546891] [2019-11-27 22:34:34,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:34,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:34,464 INFO L87 Difference]: Start difference. First operand 277 states and 400 transitions. Second operand 6 states. [2019-11-27 22:34:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:34,672 INFO L93 Difference]: Finished difference Result 394 states and 552 transitions. [2019-11-27 22:34:34,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:34:34,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-27 22:34:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:34,676 INFO L225 Difference]: With dead ends: 394 [2019-11-27 22:34:34,676 INFO L226 Difference]: Without dead ends: 317 [2019-11-27 22:34:34,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:34:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-27 22:34:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 257. [2019-11-27 22:34:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-27 22:34:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 364 transitions. [2019-11-27 22:34:34,711 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 364 transitions. Word has length 21 [2019-11-27 22:34:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:34,712 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 364 transitions. [2019-11-27 22:34:34,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 364 transitions. [2019-11-27 22:34:34,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:34:34,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:34,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:34,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:34:34,937 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash -610901190, now seen corresponding path program 1 times [2019-11-27 22:34:34,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:34,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642130988] [2019-11-27 22:34:34,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-27 22:34:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:35,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 22:34:35,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:35,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:35,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642130988] [2019-11-27 22:34:35,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:35,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 22:34:35,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909283943] [2019-11-27 22:34:35,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:35,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:35,067 INFO L87 Difference]: Start difference. First operand 257 states and 364 transitions. Second operand 7 states. [2019-11-27 22:34:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:35,424 INFO L93 Difference]: Finished difference Result 401 states and 540 transitions. [2019-11-27 22:34:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 22:34:35,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-27 22:34:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:35,427 INFO L225 Difference]: With dead ends: 401 [2019-11-27 22:34:35,428 INFO L226 Difference]: Without dead ends: 353 [2019-11-27 22:34:35,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:34:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-11-27 22:34:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2019-11-27 22:34:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-27 22:34:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 347 transitions. [2019-11-27 22:34:35,444 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 347 transitions. Word has length 25 [2019-11-27 22:34:35,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:35,445 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 347 transitions. [2019-11-27 22:34:35,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 347 transitions. [2019-11-27 22:34:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:35,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:35,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:35,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:34:35,672 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:35,673 INFO L82 PathProgramCache]: Analyzing trace with hash -873114857, now seen corresponding path program 1 times [2019-11-27 22:34:35,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:35,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163129478] [2019-11-27 22:34:35,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:35,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:35,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:35,736 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:35,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163129478] [2019-11-27 22:34:35,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:35,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:34:35,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786300772] [2019-11-27 22:34:35,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:35,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:35,757 INFO L87 Difference]: Start difference. First operand 247 states and 347 transitions. Second operand 6 states. [2019-11-27 22:34:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:35,821 INFO L93 Difference]: Finished difference Result 455 states and 634 transitions. [2019-11-27 22:34:35,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:35,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-27 22:34:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:35,833 INFO L225 Difference]: With dead ends: 455 [2019-11-27 22:34:35,833 INFO L226 Difference]: Without dead ends: 380 [2019-11-27 22:34:35,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-27 22:34:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 309. [2019-11-27 22:34:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-27 22:34:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 422 transitions. [2019-11-27 22:34:35,854 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 422 transitions. Word has length 29 [2019-11-27 22:34:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 422 transitions. [2019-11-27 22:34:35,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 422 transitions. [2019-11-27 22:34:35,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:35,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:35,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:36,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:34:36,077 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1737423153, now seen corresponding path program 1 times [2019-11-27 22:34:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:36,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079584537] [2019-11-27 22:34:36,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:36,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:36,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:34:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:36,192 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:36,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079584537] [2019-11-27 22:34:36,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:36,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:34:36,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239940399] [2019-11-27 22:34:36,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:36,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:36,267 INFO L87 Difference]: Start difference. First operand 309 states and 422 transitions. Second operand 6 states. [2019-11-27 22:34:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:36,457 INFO L93 Difference]: Finished difference Result 456 states and 627 transitions. [2019-11-27 22:34:36,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:36,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-27 22:34:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:36,461 INFO L225 Difference]: With dead ends: 456 [2019-11-27 22:34:36,461 INFO L226 Difference]: Without dead ends: 454 [2019-11-27 22:34:36,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-27 22:34:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 307. [2019-11-27 22:34:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-27 22:34:36,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 418 transitions. [2019-11-27 22:34:36,479 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 418 transitions. Word has length 29 [2019-11-27 22:34:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:36,480 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 418 transitions. [2019-11-27 22:34:36,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 418 transitions. [2019-11-27 22:34:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:34:36,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:36,481 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:36,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:34:36,693 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:36,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1232022065, now seen corresponding path program 1 times [2019-11-27 22:34:36,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:36,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444994648] [2019-11-27 22:34:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:36,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:36,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:36,805 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:36,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444994648] [2019-11-27 22:34:36,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:36,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-11-27 22:34:36,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080433819] [2019-11-27 22:34:36,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 22:34:36,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 22:34:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:34:36,870 INFO L87 Difference]: Start difference. First operand 307 states and 418 transitions. Second operand 13 states. [2019-11-27 22:34:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:38,030 INFO L93 Difference]: Finished difference Result 581 states and 777 transitions. [2019-11-27 22:34:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-27 22:34:38,031 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-27 22:34:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:38,034 INFO L225 Difference]: With dead ends: 581 [2019-11-27 22:34:38,034 INFO L226 Difference]: Without dead ends: 540 [2019-11-27 22:34:38,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-11-27 22:34:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-27 22:34:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 372. [2019-11-27 22:34:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-27 22:34:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 504 transitions. [2019-11-27 22:34:38,062 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 504 transitions. Word has length 30 [2019-11-27 22:34:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:38,062 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 504 transitions. [2019-11-27 22:34:38,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 22:34:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 504 transitions. [2019-11-27 22:34:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:34:38,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:38,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:38,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:34:38,275 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763763, now seen corresponding path program 1 times [2019-11-27 22:34:38,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:38,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339768666] [2019-11-27 22:34:38,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:38,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:38,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:38,336 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:38,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339768666] [2019-11-27 22:34:38,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:38,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:34:38,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161031352] [2019-11-27 22:34:38,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:38,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:38,354 INFO L87 Difference]: Start difference. First operand 372 states and 504 transitions. Second operand 6 states. [2019-11-27 22:34:38,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:38,449 INFO L93 Difference]: Finished difference Result 429 states and 579 transitions. [2019-11-27 22:34:38,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:38,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-27 22:34:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:38,455 INFO L225 Difference]: With dead ends: 429 [2019-11-27 22:34:38,456 INFO L226 Difference]: Without dead ends: 424 [2019-11-27 22:34:38,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-27 22:34:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2019-11-27 22:34:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-27 22:34:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 499 transitions. [2019-11-27 22:34:38,481 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 499 transitions. Word has length 30 [2019-11-27 22:34:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:38,484 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 499 transitions. [2019-11-27 22:34:38,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 499 transitions. [2019-11-27 22:34:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:34:38,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:38,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:38,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:34:38,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1505781804, now seen corresponding path program 1 times [2019-11-27 22:34:38,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:38,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063715629] [2019-11-27 22:34:38,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:38,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:38,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:38,775 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:38,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063715629] [2019-11-27 22:34:38,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:38,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:34:38,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435593981] [2019-11-27 22:34:38,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:38,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:38,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:38,792 INFO L87 Difference]: Start difference. First operand 372 states and 499 transitions. Second operand 6 states. [2019-11-27 22:34:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:38,866 INFO L93 Difference]: Finished difference Result 775 states and 1019 transitions. [2019-11-27 22:34:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:38,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-27 22:34:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:38,870 INFO L225 Difference]: With dead ends: 775 [2019-11-27 22:34:38,870 INFO L226 Difference]: Without dead ends: 716 [2019-11-27 22:34:38,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-11-27 22:34:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 390. [2019-11-27 22:34:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-27 22:34:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 524 transitions. [2019-11-27 22:34:38,896 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 524 transitions. Word has length 31 [2019-11-27 22:34:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:38,897 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 524 transitions. [2019-11-27 22:34:38,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 524 transitions. [2019-11-27 22:34:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:34:38,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:38,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:39,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 22:34:39,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:39,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1078465644, now seen corresponding path program 1 times [2019-11-27 22:34:39,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:39,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631192255] [2019-11-27 22:34:39,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:39,243 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 22:34:39,246 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:39,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 22:34:39,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:39 BoogieIcfgContainer [2019-11-27 22:34:39,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:39,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:39,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:39,502 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:39,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:32" (3/4) ... [2019-11-27 22:34:39,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:34:39,654 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:39,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:39,657 INFO L168 Benchmark]: Toolchain (without parser) took 8601.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 951.0 MB in the beginning and 895.9 MB in the end (delta: 55.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:39,658 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:39,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:39,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:39,664 INFO L168 Benchmark]: Boogie Preprocessor took 39.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:39,664 INFO L168 Benchmark]: RCFGBuilder took 654.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:39,665 INFO L168 Benchmark]: TraceAbstraction took 7229.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 895.9 MB in the end (delta: 152.0 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:39,665 INFO L168 Benchmark]: Witness Printer took 152.84 ms. Allocated memory is still 1.2 GB. Free memory was 895.9 MB in the beginning and 895.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-27 22:34:39,667 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 654.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7229.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.6 MB). Free memory was 1.0 GB in the beginning and 895.9 MB in the end (delta: 152.0 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. * Witness Printer took 152.84 ms. Allocated memory is still 1.2 GB. Free memory was 895.9 MB in the beginning and 895.9 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) [L6] COND FALSE !(!(cond)) [L105] delta = ea - eb [L6] COND TRUE !(cond) [L7] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 6 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1352 SDtfs, 3612 SDslu, 5031 SDs, 0 SdLazy, 992 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 541 GetRequests, 445 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1273 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 488 ConstructedInterpolants, 0 QuantifiedInterpolants, 22852 SizeOfPredicates, 45 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...