./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 fa5701cbf2aecb18d72b6e5744b88307065d31ab ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4-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 fa5701cbf2aecb18d72b6e5744b88307065d31ab ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:38,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:38,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:38,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:38,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:38,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:38,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:38,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:38,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:38,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:38,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:38,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:38,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:38,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:38,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:38,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:38,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:38,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:38,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:38,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:38,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:38,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:38,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:38,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:38,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:38,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:38,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:38,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:38,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:38,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:38,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:38,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:38,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:38,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:38,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:38,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:38,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:38,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:38,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:38,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:38,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:38,145 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:38,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:38,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:38,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:38,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:38,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:38,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:38,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:38,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:38,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:38,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:38,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:38,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:38,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:38,171 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:38,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:38,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:38,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:38,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:38,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:38,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:38,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:38,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:38,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:38,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:38,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:38,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:38,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:38,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:38,175 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 -> fa5701cbf2aecb18d72b6e5744b88307065d31ab [2019-11-27 22:34:38,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:38,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:38,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:38,485 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:38,486 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:38,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-11-27 22:34:38,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76766efee/1d4028bde240453ba31a77346748ff72/FLAG0743cb053 [2019-11-27 22:34:39,019 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:39,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-11-27 22:34:39,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76766efee/1d4028bde240453ba31a77346748ff72/FLAG0743cb053 [2019-11-27 22:34:39,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76766efee/1d4028bde240453ba31a77346748ff72 [2019-11-27 22:34:39,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:39,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:39,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:39,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:39,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:39,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:39" (1/1) ... [2019-11-27 22:34:39,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a02a077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:39, skipping insertion in model container [2019-11-27 22:34:39,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:39" (1/1) ... [2019-11-27 22:34:39,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:39,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:39,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:39,656 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:39,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:39,775 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:39,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:39 WrapperNode [2019-11-27 22:34:39,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:39,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:39,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:39,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:39,783 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:39" (1/1) ... [2019-11-27 22:34:39,789 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:39" (1/1) ... [2019-11-27 22:34:39,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:39,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:39,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:39,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:39,834 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:39" (1/1) ... [2019-11-27 22:34:39,834 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:39" (1/1) ... [2019-11-27 22:34:39,837 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:39" (1/1) ... [2019-11-27 22:34:39,837 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:39" (1/1) ... [2019-11-27 22:34:39,845 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:39" (1/1) ... [2019-11-27 22:34:39,853 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:39" (1/1) ... [2019-11-27 22:34:39,856 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:39" (1/1) ... [2019-11-27 22:34:39,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:39,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:39,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:39,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:39,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:39" (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:39,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:39,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:40,403 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:40,403 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 22:34:40,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:40 BoogieIcfgContainer [2019-11-27 22:34:40,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:40,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:40,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:40,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:40,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:39" (1/3) ... [2019-11-27 22:34:40,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f824463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:40, skipping insertion in model container [2019-11-27 22:34:40,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:39" (2/3) ... [2019-11-27 22:34:40,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f824463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:40, skipping insertion in model container [2019-11-27 22:34:40,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:40" (3/3) ... [2019-11-27 22:34:40,413 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2019-11-27 22:34:40,422 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:40,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-27 22:34:40,442 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-27 22:34:40,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:40,482 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:40,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:40,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:40,483 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:40,483 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:40,485 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:40,485 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-27 22:34:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:34:40,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:40,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:40,506 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 299467151, now seen corresponding path program 1 times [2019-11-27 22:34:40,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:40,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772578501] [2019-11-27 22:34:40,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:40,882 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:40,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772578501] [2019-11-27 22:34:40,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:40,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:40,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800282210] [2019-11-27 22:34:40,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:40,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:40,906 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 8 states. [2019-11-27 22:34:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:41,444 INFO L93 Difference]: Finished difference Result 269 states and 396 transitions. [2019-11-27 22:34:41,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:34:41,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-27 22:34:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:41,468 INFO L225 Difference]: With dead ends: 269 [2019-11-27 22:34:41,468 INFO L226 Difference]: Without dead ends: 170 [2019-11-27 22:34:41,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:34:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-27 22:34:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 110. [2019-11-27 22:34:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-27 22:34:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2019-11-27 22:34:41,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 14 [2019-11-27 22:34:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:41,567 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-11-27 22:34:41,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2019-11-27 22:34:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:34:41,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:41,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:41,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1417488386, now seen corresponding path program 1 times [2019-11-27 22:34:41,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:41,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17213975] [2019-11-27 22:34:41,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:41,866 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:41,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17213975] [2019-11-27 22:34:41,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:41,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:41,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456173213] [2019-11-27 22:34:41,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:41,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:41,875 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand 8 states. [2019-11-27 22:34:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,206 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2019-11-27 22:34:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 22:34:42,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-27 22:34:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,211 INFO L225 Difference]: With dead ends: 183 [2019-11-27 22:34:42,213 INFO L226 Difference]: Without dead ends: 154 [2019-11-27 22:34:42,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:34:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-27 22:34:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 99. [2019-11-27 22:34:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-27 22:34:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2019-11-27 22:34:42,237 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 18 [2019-11-27 22:34:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,238 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2019-11-27 22:34:42,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2019-11-27 22:34:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:42,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,240 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] [2019-11-27 22:34:42,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:42,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1094887938, now seen corresponding path program 1 times [2019-11-27 22:34:42,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:42,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959262376] [2019-11-27 22:34:42,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,571 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:42,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959262376] [2019-11-27 22:34:42,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:42,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-27 22:34:42,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922351058] [2019-11-27 22:34:42,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 22:34:42,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 22:34:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:34:42,574 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 15 states. [2019-11-27 22:34:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:43,736 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2019-11-27 22:34:43,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-27 22:34:43,738 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-27 22:34:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:43,740 INFO L225 Difference]: With dead ends: 225 [2019-11-27 22:34:43,740 INFO L226 Difference]: Without dead ends: 221 [2019-11-27 22:34:43,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2019-11-27 22:34:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-27 22:34:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 107. [2019-11-27 22:34:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-27 22:34:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 137 transitions. [2019-11-27 22:34:43,754 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 137 transitions. Word has length 22 [2019-11-27 22:34:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:43,754 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 137 transitions. [2019-11-27 22:34:43,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 22:34:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2019-11-27 22:34:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:43,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:43,756 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] [2019-11-27 22:34:43,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 743535808, now seen corresponding path program 1 times [2019-11-27 22:34:43,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:43,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882720140] [2019-11-27 22:34:43,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:43,868 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:43,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882720140] [2019-11-27 22:34:43,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:43,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:43,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648087657] [2019-11-27 22:34:43,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:43,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:43,871 INFO L87 Difference]: Start difference. First operand 107 states and 137 transitions. Second operand 8 states. [2019-11-27 22:34:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:44,065 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2019-11-27 22:34:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:44,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-27 22:34:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:44,067 INFO L225 Difference]: With dead ends: 171 [2019-11-27 22:34:44,067 INFO L226 Difference]: Without dead ends: 146 [2019-11-27 22:34:44,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:34:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-27 22:34:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2019-11-27 22:34:44,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-27 22:34:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2019-11-27 22:34:44,086 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 22 [2019-11-27 22:34:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:44,086 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2019-11-27 22:34:44,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2019-11-27 22:34:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:44,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:44,089 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] [2019-11-27 22:34:44,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash 743595390, now seen corresponding path program 1 times [2019-11-27 22:34:44,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:44,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617053546] [2019-11-27 22:34:44,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:44,255 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:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617053546] [2019-11-27 22:34:44,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:44,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 22:34:44,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106342186] [2019-11-27 22:34:44,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:44,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:44,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:44,257 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 8 states. [2019-11-27 22:34:44,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:44,445 INFO L93 Difference]: Finished difference Result 157 states and 195 transitions. [2019-11-27 22:34:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:34:44,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-27 22:34:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:44,447 INFO L225 Difference]: With dead ends: 157 [2019-11-27 22:34:44,447 INFO L226 Difference]: Without dead ends: 132 [2019-11-27 22:34:44,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-27 22:34:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-27 22:34:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2019-11-27 22:34:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-27 22:34:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2019-11-27 22:34:44,472 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 22 [2019-11-27 22:34:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:44,473 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2019-11-27 22:34:44,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2019-11-27 22:34:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:44,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:44,477 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] [2019-11-27 22:34:44,477 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash 620652719, now seen corresponding path program 1 times [2019-11-27 22:34:44,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:44,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340694945] [2019-11-27 22:34:44,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:44,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:34:44,590 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:44,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:44 BoogieIcfgContainer [2019-11-27 22:34:44,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:44,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:44,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:44,619 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:44,619 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:40" (3/4) ... [2019-11-27 22:34:44,623 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 22:34:44,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:44,626 INFO L168 Benchmark]: Toolchain (without parser) took 5247.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -64.9 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:44,626 INFO L168 Benchmark]: CDTParser took 0.25 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:44,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:44,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.62 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:44,629 INFO L168 Benchmark]: Boogie Preprocessor took 34.16 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:44,630 INFO L168 Benchmark]: RCFGBuilder took 545.33 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.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:44,631 INFO L168 Benchmark]: TraceAbstraction took 4211.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.8 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:44,631 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:44,635 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.25 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 395.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.62 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 34.16 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 545.33 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.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4211.88 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 82.8 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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_add1 ; [L223] unsigned int r_add2 ; [L224] unsigned int zero ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int __retres14 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L231] 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); [L232] 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); [L233] b = base2flt(mb, eb) [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, 85 locations, 7 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 443 SDtfs, 1134 SDslu, 3048 SDs, 0 SdLazy, 822 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=1, 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, 5 MinimizatonAttempts, 287 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 8117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:46,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:46,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:46,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:46,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:46,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:46,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:46,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:46,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:46,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:46,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:46,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:46,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:46,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:46,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:46,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:46,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:46,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:46,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:46,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:46,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:46,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:46,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:46,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:46,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:46,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:46,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:46,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:46,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:46,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:46,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:46,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:46,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:46,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:46,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:46,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:46,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:46,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:46,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:46,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:46,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:46,889 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:46,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:46,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:46,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:46,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:46,912 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:46,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:46,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:46,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:46,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:46,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:46,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:46,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:46,915 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:34:46,916 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:34:46,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:46,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:46,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:46,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:46,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:46,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:46,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:46,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:46,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:46,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:46,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:46,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:46,919 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:34:46,920 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:34:46,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:46,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:34:46,920 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 -> fa5701cbf2aecb18d72b6e5744b88307065d31ab [2019-11-27 22:34:47,239 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:47,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:47,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:47,268 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:47,269 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:47,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-11-27 22:34:47,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e9971bf/b34d0da9d0fa4fdaa57431606a3e1462/FLAG99b023f93 [2019-11-27 22:34:47,834 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:47,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2019-11-27 22:34:47,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e9971bf/b34d0da9d0fa4fdaa57431606a3e1462/FLAG99b023f93 [2019-11-27 22:34:48,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65e9971bf/b34d0da9d0fa4fdaa57431606a3e1462 [2019-11-27 22:34:48,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:48,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:48,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:48,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:48,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:48,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:48" (1/1) ... [2019-11-27 22:34:48,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6e971e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:48, skipping insertion in model container [2019-11-27 22:34:48,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:48" (1/1) ... [2019-11-27 22:34:48,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:48,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:48,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:48,459 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:48,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:48,582 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:48,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:48 WrapperNode [2019-11-27 22:34:48,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:48,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:48,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:48,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:48,592 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:48" (1/1) ... [2019-11-27 22:34:48,602 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:48" (1/1) ... [2019-11-27 22:34:48,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:48,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:48,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:48,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:48,646 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:48" (1/1) ... [2019-11-27 22:34:48,646 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:48" (1/1) ... [2019-11-27 22:34:48,650 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:48" (1/1) ... [2019-11-27 22:34:48,650 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:48" (1/1) ... [2019-11-27 22:34:48,659 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:48" (1/1) ... [2019-11-27 22:34:48,666 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:48" (1/1) ... [2019-11-27 22:34:48,668 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:48" (1/1) ... [2019-11-27 22:34:48,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:48,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:48,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:48,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:48,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:48" (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:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:48,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:49,259 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:49,260 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 22:34:49,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:49 BoogieIcfgContainer [2019-11-27 22:34:49,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:49,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:49,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:49,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:48" (1/3) ... [2019-11-27 22:34:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aec93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:49, skipping insertion in model container [2019-11-27 22:34:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:48" (2/3) ... [2019-11-27 22:34:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aec93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:49, skipping insertion in model container [2019-11-27 22:34:49,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:49" (3/3) ... [2019-11-27 22:34:49,269 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2019-11-27 22:34:49,278 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:49,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-27 22:34:49,296 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-27 22:34:49,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:49,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:49,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:49,318 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:49,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:49,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:49,319 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:49,319 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-27 22:34:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 22:34:49,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:49,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:49,340 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:49,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:49,345 INFO L82 PathProgramCache]: Analyzing trace with hash 299467151, now seen corresponding path program 1 times [2019-11-27 22:34:49,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:49,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317937720] [2019-11-27 22:34:49,356 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:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:49,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:34:49,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:49,495 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:49,496 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:49,524 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:49,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317937720] [2019-11-27 22:34:49,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:49,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 22:34:49,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751616713] [2019-11-27 22:34:49,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:49,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:49,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:49,553 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 5 states. [2019-11-27 22:34:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:49,745 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2019-11-27 22:34:49,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:49,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-27 22:34:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:49,764 INFO L225 Difference]: With dead ends: 230 [2019-11-27 22:34:49,765 INFO L226 Difference]: Without dead ends: 138 [2019-11-27 22:34:49,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-27 22:34:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2019-11-27 22:34:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-27 22:34:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2019-11-27 22:34:49,827 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 14 [2019-11-27 22:34:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:49,827 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2019-11-27 22:34:49,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2019-11-27 22:34:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:34:49,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:49,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:50,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:34:50,041 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1540311893, now seen corresponding path program 1 times [2019-11-27 22:34:50,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:50,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061856548] [2019-11-27 22:34:50,044 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:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:50,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:34:50,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:50,177 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:50,177 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:50,211 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:50,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061856548] [2019-11-27 22:34:50,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:50,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-27 22:34:50,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542475] [2019-11-27 22:34:50,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:50,215 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand 6 states. [2019-11-27 22:34:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:50,441 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2019-11-27 22:34:50,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:34:50,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-27 22:34:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:50,446 INFO L225 Difference]: With dead ends: 225 [2019-11-27 22:34:50,447 INFO L226 Difference]: Without dead ends: 199 [2019-11-27 22:34:50,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:34:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-27 22:34:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 118. [2019-11-27 22:34:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-27 22:34:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 161 transitions. [2019-11-27 22:34:50,465 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 161 transitions. Word has length 18 [2019-11-27 22:34:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:50,465 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 161 transitions. [2019-11-27 22:34:50,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 161 transitions. [2019-11-27 22:34:50,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:34:50,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:50,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:50,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:34:50,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1417428804, now seen corresponding path program 1 times [2019-11-27 22:34:50,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:50,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057650073] [2019-11-27 22:34:50,676 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:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:50,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 22:34:50,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:50,802 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:50,802 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:50,815 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:50,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057650073] [2019-11-27 22:34:50,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:50,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 22:34:50,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624643046] [2019-11-27 22:34:50,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:50,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:50,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:50,824 INFO L87 Difference]: Start difference. First operand 118 states and 161 transitions. Second operand 7 states. [2019-11-27 22:34:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:51,126 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2019-11-27 22:34:51,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 22:34:51,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-27 22:34:51,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:51,129 INFO L225 Difference]: With dead ends: 213 [2019-11-27 22:34:51,129 INFO L226 Difference]: Without dead ends: 184 [2019-11-27 22:34:51,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-11-27 22:34:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-27 22:34:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 107. [2019-11-27 22:34:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-27 22:34:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2019-11-27 22:34:51,142 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 18 [2019-11-27 22:34:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:51,142 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2019-11-27 22:34:51,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2019-11-27 22:34:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:51,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:51,144 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] [2019-11-27 22:34:51,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:34:51,356 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:51,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1094887938, now seen corresponding path program 1 times [2019-11-27 22:34:51,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:51,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760946272] [2019-11-27 22:34:51,359 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:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:51,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:51,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:51,466 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:51,466 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:51,490 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:51,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760946272] [2019-11-27 22:34:51,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:51,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 22:34:51,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44512013] [2019-11-27 22:34:51,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:34:51,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:34:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:34:51,493 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand 9 states. [2019-11-27 22:34:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:51,804 INFO L93 Difference]: Finished difference Result 182 states and 229 transitions. [2019-11-27 22:34:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:51,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-27 22:34:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:51,810 INFO L225 Difference]: With dead ends: 182 [2019-11-27 22:34:51,810 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 22:34:51,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-27 22:34:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 22:34:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-11-27 22:34:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-27 22:34:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2019-11-27 22:34:51,827 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 22 [2019-11-27 22:34:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:51,827 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2019-11-27 22:34:51,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:34:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2019-11-27 22:34:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:51,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:51,829 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] [2019-11-27 22:34:52,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:34:52,030 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 743535808, now seen corresponding path program 1 times [2019-11-27 22:34:52,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:52,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32330695] [2019-11-27 22:34:52,032 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:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:52,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 22:34:52,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:52,120 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:52,121 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:52,126 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:52,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32330695] [2019-11-27 22:34:52,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:52,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-27 22:34:52,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691332793] [2019-11-27 22:34:52,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:52,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:52,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:34:52,130 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand 7 states. [2019-11-27 22:34:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:52,274 INFO L93 Difference]: Finished difference Result 181 states and 229 transitions. [2019-11-27 22:34:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:52,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-27 22:34:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:52,276 INFO L225 Difference]: With dead ends: 181 [2019-11-27 22:34:52,276 INFO L226 Difference]: Without dead ends: 148 [2019-11-27 22:34:52,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:34:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-27 22:34:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2019-11-27 22:34:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-27 22:34:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 155 transitions. [2019-11-27 22:34:52,287 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 155 transitions. Word has length 22 [2019-11-27 22:34:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 155 transitions. [2019-11-27 22:34:52,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 155 transitions. [2019-11-27 22:34:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 22:34:52,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:52,289 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] [2019-11-27 22:34:52,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:34:52,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash 620652719, now seen corresponding path program 1 times [2019-11-27 22:34:52,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:52,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108988407] [2019-11-27 22:34:52,501 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:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:52,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:52,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:34:52,576 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:52,576 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:52,602 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:52,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108988407] [2019-11-27 22:34:52,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:52,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 22:34:52,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835343407] [2019-11-27 22:34:52,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:52,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:52,604 INFO L87 Difference]: Start difference. First operand 118 states and 155 transitions. Second operand 6 states. [2019-11-27 22:34:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:52,818 INFO L93 Difference]: Finished difference Result 182 states and 237 transitions. [2019-11-27 22:34:52,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:52,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-27 22:34:52,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:52,825 INFO L225 Difference]: With dead ends: 182 [2019-11-27 22:34:52,826 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 22:34:52,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 22:34:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 114. [2019-11-27 22:34:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-27 22:34:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 151 transitions. [2019-11-27 22:34:52,836 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 151 transitions. Word has length 22 [2019-11-27 22:34:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:52,836 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-11-27 22:34:52,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 151 transitions. [2019-11-27 22:34:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:52,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:52,838 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] [2019-11-27 22:34:53,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:34:53,050 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash 131253304, now seen corresponding path program 1 times [2019-11-27 22:34:53,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:53,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886326689] [2019-11-27 22:34:53,052 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:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:53,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 22:34:53,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:53,150 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:53,151 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:53,185 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:53,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886326689] [2019-11-27 22:34:53,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:53,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-27 22:34:53,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144705408] [2019-11-27 22:34:53,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:34:53,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:34:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:34:53,189 INFO L87 Difference]: Start difference. First operand 114 states and 151 transitions. Second operand 9 states. [2019-11-27 22:34:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:53,498 INFO L93 Difference]: Finished difference Result 164 states and 203 transitions. [2019-11-27 22:34:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:34:53,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-27 22:34:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:53,500 INFO L225 Difference]: With dead ends: 164 [2019-11-27 22:34:53,500 INFO L226 Difference]: Without dead ends: 159 [2019-11-27 22:34:53,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-11-27 22:34:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-27 22:34:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2019-11-27 22:34:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 22:34:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2019-11-27 22:34:53,510 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 24 [2019-11-27 22:34:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:53,511 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2019-11-27 22:34:53,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:34:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2019-11-27 22:34:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:53,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:53,512 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] [2019-11-27 22:34:53,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:34:53,729 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash 133100346, now seen corresponding path program 1 times [2019-11-27 22:34:53,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:53,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916441860] [2019-11-27 22:34:53,731 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:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:53,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 22:34:53,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:53,833 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:53,834 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:53,843 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:53,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916441860] [2019-11-27 22:34:53,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:53,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-11-27 22:34:53,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031406972] [2019-11-27 22:34:53,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:53,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:53,845 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand 6 states. [2019-11-27 22:34:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:53,962 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2019-11-27 22:34:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:53,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 22:34:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:53,964 INFO L225 Difference]: With dead ends: 144 [2019-11-27 22:34:53,964 INFO L226 Difference]: Without dead ends: 125 [2019-11-27 22:34:53,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-27 22:34:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-27 22:34:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-27 22:34:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2019-11-27 22:34:53,974 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 24 [2019-11-27 22:34:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:53,975 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2019-11-27 22:34:53,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2019-11-27 22:34:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:53,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:53,976 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] [2019-11-27 22:34:54,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:34:54,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash -553029582, now seen corresponding path program 1 times [2019-11-27 22:34:54,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:54,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831430799] [2019-11-27 22:34:54,191 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:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:54,298 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 22:34:54,298 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:54,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:34:54,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:54 BoogieIcfgContainer [2019-11-27 22:34:54,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:54,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:54,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:54,542 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:54,542 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:49" (3/4) ... [2019-11-27 22:34:54,545 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:34:54,643 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:54,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:54,645 INFO L168 Benchmark]: Toolchain (without parser) took 6484.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:54,645 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:54,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:54,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.29 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:54,647 INFO L168 Benchmark]: Boogie Preprocessor took 34.19 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:54,647 INFO L168 Benchmark]: RCFGBuilder took 588.85 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:54,648 INFO L168 Benchmark]: TraceAbstraction took 5278.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:54,648 INFO L168 Benchmark]: Witness Printer took 101.44 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:54,650 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 422.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.29 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. * Boogie Preprocessor took 34.19 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 588.85 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5278.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.6 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. * Witness Printer took 101.44 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: 7.1 MB). Peak memory consumption was 7.1 MB. 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_add1 ; [L223] unsigned int r_add2 ; [L224] unsigned int zero ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int __retres14 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L231] 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); [L232] 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); [L233] b = base2flt(mb, eb) [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, 85 locations, 7 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 852 SDtfs, 1261 SDslu, 3672 SDs, 0 SdLazy, 632 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 275 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, 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, 8 MinimizatonAttempts, 401 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 11560 SizeOfPredicates, 49 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...