/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.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 54d55f53df298587c33765daf95d2959f5ea09aa .......................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.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 54d55f53df298587c33765daf95d2959f5ea09aa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-40ef509 [2018-09-20 15:32:48,203 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:32:48,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:32:48,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:32:48,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:32:48,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:32:48,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:32:48,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:32:48,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:32:48,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:32:48,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:32:48,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:32:48,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:32:48,245 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:32:48,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:32:48,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:32:48,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:32:48,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:32:48,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:32:48,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:32:48,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:32:48,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:32:48,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:32:48,274 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:32:48,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:32:48,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:32:48,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:32:48,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:32:48,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:32:48,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:32:48,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:32:48,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:32:48,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:32:48,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:32:48,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:32:48,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:32:48,286 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:32:48,313 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:32:48,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:32:48,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:32:48,315 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:32:48,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:32:48,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:32:48,316 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:32:48,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:32:48,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:32:48,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:32:48,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:32:48,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:32:48,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:32:48,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:32:48,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:32:48,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:32:48,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:32:48,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:32:48,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:32:48,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:32:48,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:32:48,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:32:48,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:48,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:32:48,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:32:48,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:32:48,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:32:48,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:32:48,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:32:48,326 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 54d55f53df298587c33765daf95d2959f5ea09aa [2018-09-20 15:32:48,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:32:48,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:32:48,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:32:48,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:32:48,415 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:32:48,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:48,761 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014c888b5/9ffac72bf8d14b85a74a7fde8a02faa1/FLAGf6a75bb5b [2018-09-20 15:32:48,894 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:32:48,895 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:48,902 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014c888b5/9ffac72bf8d14b85a74a7fde8a02faa1/FLAGf6a75bb5b [2018-09-20 15:32:48,918 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014c888b5/9ffac72bf8d14b85a74a7fde8a02faa1 [2018-09-20 15:32:48,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:32:48,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:32:48,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:48,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:32:48,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:32:48,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:48" (1/1) ... [2018-09-20 15:32:48,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223424f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:48, skipping insertion in model container [2018-09-20 15:32:48,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:48" (1/1) ... [2018-09-20 15:32:48,951 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:32:49,205 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:49,225 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:32:49,261 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:49,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49 WrapperNode [2018-09-20 15:32:49,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:49,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:32:49,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:32:49,292 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:32:49,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (1/1) ... [2018-09-20 15:32:49,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:32:49,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:32:49,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:32:49,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:32:49,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (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 [2018-09-20 15:32:49,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:32:49,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:32:49,427 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:32:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:32:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:32:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:32:49,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:32:49,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:32:49,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:32:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:32:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:32:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:32:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:32:49,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:32:49,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:32:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:32:49,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:32:50,062 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:50,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:50 BoogieIcfgContainer [2018-09-20 15:32:50,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:50,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:50,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:50,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:50,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:32:48" (1/3) ... [2018-09-20 15:32:50,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678b7af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:50, skipping insertion in model container [2018-09-20 15:32:50,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:49" (2/3) ... [2018-09-20 15:32:50,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678b7af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:50, skipping insertion in model container [2018-09-20 15:32:50,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:50" (3/3) ... [2018-09-20 15:32:50,075 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:50,086 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:50,098 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:50,149 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:50,150 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:50,150 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:50,150 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:50,150 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:50,150 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:50,151 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:50,151 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:50,151 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-09-20 15:32:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 15:32:50,179 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:50,180 INFO L376 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] [2018-09-20 15:32:50,183 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:50,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1095093143, now seen corresponding path program 1 times [2018-09-20 15:32:50,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:50,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:50,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:50,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:50,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:50,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:50,359 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:50,359 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:50,362 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-09-20 15:32:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:50,391 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2018-09-20 15:32:50,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:50,393 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-09-20 15:32:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:50,404 INFO L225 Difference]: With dead ends: 119 [2018-09-20 15:32:50,404 INFO L226 Difference]: Without dead ends: 60 [2018-09-20 15:32:50,409 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-20 15:32:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-20 15:32:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-20 15:32:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-09-20 15:32:50,456 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 22 [2018-09-20 15:32:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:50,457 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-09-20 15:32:50,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-09-20 15:32:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 15:32:50,461 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:50,461 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:50,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1483022669, now seen corresponding path program 1 times [2018-09-20 15:32:50,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:50,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:50,672 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:50,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:50,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:50,675 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:50,675 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:50,676 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 4 states. [2018-09-20 15:32:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:50,865 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-09-20 15:32:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:50,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-09-20 15:32:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:50,871 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:32:50,871 INFO L226 Difference]: Without dead ends: 64 [2018-09-20 15:32:50,872 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-20 15:32:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-20 15:32:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:32:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-09-20 15:32:50,887 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 35 [2018-09-20 15:32:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:50,888 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-09-20 15:32:50,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-09-20 15:32:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:32:50,891 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:50,892 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:50,892 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash 184182308, now seen corresponding path program 1 times [2018-09-20 15:32:50,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:50,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:50,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:50,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:51,072 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:51,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:51,074 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:51,074 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:51,074 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 4 states. [2018-09-20 15:32:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:51,175 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-09-20 15:32:51,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:51,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-20 15:32:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:51,179 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:32:51,179 INFO L226 Difference]: Without dead ends: 68 [2018-09-20 15:32:51,180 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-20 15:32:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-09-20 15:32:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-20 15:32:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-09-20 15:32:51,200 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 38 [2018-09-20 15:32:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:51,201 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-09-20 15:32:51,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-09-20 15:32:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:32:51,204 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:51,205 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:51,205 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1612769051, now seen corresponding path program 1 times [2018-09-20 15:32:51,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:32:51,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:32:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:51,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:32:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:32:51,333 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:32:51,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:32:51 BoogieIcfgContainer [2018-09-20 15:32:51,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:32:51,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:32:51,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:32:51,371 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:32:51,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:50" (3/4) ... [2018-09-20 15:32:51,380 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:32:51,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:32:51,382 INFO L168 Benchmark]: Toolchain (without parser) took 2459.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -100.3 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:51,385 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:51,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:51,386 INFO L168 Benchmark]: Boogie Preprocessor took 64.83 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:32:51,387 INFO L168 Benchmark]: RCFGBuilder took 707.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:51,388 INFO L168 Benchmark]: TraceAbstraction took 1305.63 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:32:51,389 INFO L168 Benchmark]: Witness Printer took 9.18 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. [2018-09-20 15:32:51,394 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.83 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 707.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1305.63 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: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * Witness Printer took 9.18 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 74. Possible FailurePath: [L74] double x = -0.0; [L75] double y = 0.0; VAL [y=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967302, \old(y)=0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L19] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L22] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967302, ew_u={4294967300:0}, x=4294967302] [L23] FCALL ew_u.value = (x) VAL [\old(x)=4294967302, ew_u={4294967300:0}, x=4294967302] [L24] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.msw=2146435073, x=4294967302] [L24] (msw) = ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.msw=2146435073, msw=2146435073, x=4294967302] [L24] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967298, \old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.msw=2146435073, msw=2146435073, x=4294967302] [L25] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.lsw=4294967297, msw=2146435073, x=4294967302] [L25] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=2146435073, x=4294967302] [L25] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967303, \old(x)=4294967302, ew_u={4294967300:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=2146435073, x=4294967302] [L26] COND FALSE !(0) VAL [\old(x)=4294967302, lsw=4294967297, msw=2146435073, x=4294967302] [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=2146435073, x=4294967302] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=2146435073, x=4294967302] [L34-L35] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=2146435073, x=4294967302] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] RET return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=2146435073, x=4294967302] [L46] EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=0, __fpclassify_double(x)=0, x=4294967302, y=0] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] RET return y; VAL [\old(x)=4294967302, \old(y)=0, \result=0, x=4294967302, y=0] [L76] EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0, x=4294967302, y=0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0, res == -0.0 && __signbit_double(res) == 1=0, x=4294967302, y=0] [L79] COND FALSE, EXPR !(res == -0.0 && __signbit_double(res) == 1) VAL [res=0, res == -0.0 && __signbit_double(res) == 1=0, x=4294967302, y=0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0, x=4294967302, y=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 209 SDtfs, 0 SDslu, 258 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 3534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-40ef509 [2018-09-20 15:32:53,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:32:53,745 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:32:53,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:32:53,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:32:53,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:32:53,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:32:53,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:32:53,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:32:53,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:32:53,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:32:53,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:32:53,776 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:32:53,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:32:53,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:32:53,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:32:53,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:32:53,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:32:53,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:32:53,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:32:53,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:32:53,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:32:53,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:32:53,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:32:53,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:32:53,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:32:53,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:32:53,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:32:53,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:32:53,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:32:53,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:32:53,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:32:53,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:32:53,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:32:53,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:32:53,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:32:53,803 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:32:53,831 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:32:53,831 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:32:53,832 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:32:53,832 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:32:53,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:32:53,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:32:53,833 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:32:53,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:32:53,836 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:32:53,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:32:53,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:32:53,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:32:53,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:32:53,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:32:53,838 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:32:53,838 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:32:53,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:32:53,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:32:53,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:32:53,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:32:53,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:32:53,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:32:53,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:32:53,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:32:53,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:32:53,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:32:53,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:32:53,840 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:32:53,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:32:53,844 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:32:53,844 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:32:53,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 54d55f53df298587c33765daf95d2959f5ea09aa [2018-09-20 15:32:53,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:32:53,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:32:53,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:32:53,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:32:53,950 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:32:53,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:54,312 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8ff6d2/9906f173ef1a4996909f34f94173b7eb/FLAGd6c87954c [2018-09-20 15:32:54,486 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:32:54,487 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:54,495 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8ff6d2/9906f173ef1a4996909f34f94173b7eb/FLAGd6c87954c [2018-09-20 15:32:54,511 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b8ff6d2/9906f173ef1a4996909f34f94173b7eb [2018-09-20 15:32:54,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:32:54,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:32:54,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:54,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:32:54,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:32:54,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1664520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54, skipping insertion in model container [2018-09-20 15:32:54,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,545 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:32:54,757 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:54,777 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:32:54,796 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:32:54,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54 WrapperNode [2018-09-20 15:32:54,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:32:54,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:32:54,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:32:54,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:32:54,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (1/1) ... [2018-09-20 15:32:54,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:32:54,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:32:54,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:32:54,949 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:32:54,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (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 [2018-09-20 15:32:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:32:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:32:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:32:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:32:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:32:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:32:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:32:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:32:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:32:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:32:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:32:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:32:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:32:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:32:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:32:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:32:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:32:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:32:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:32:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:32:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:32:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:32:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:32:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:32:55,362 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:55,410 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:55,632 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:55,645 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:55,671 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:32:55,739 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:32:55,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:55 BoogieIcfgContainer [2018-09-20 15:32:55,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:32:55,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:32:55,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:32:55,745 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:32:55,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:32:54" (1/3) ... [2018-09-20 15:32:55,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:55, skipping insertion in model container [2018-09-20 15:32:55,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:32:54" (2/3) ... [2018-09-20 15:32:55,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173bfd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:32:55, skipping insertion in model container [2018-09-20 15:32:55,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:55" (3/3) ... [2018-09-20 15:32:55,750 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b_false-unreach-call.c [2018-09-20 15:32:55,761 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:32:55,770 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:32:55,821 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:32:55,822 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:32:55,822 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:32:55,822 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:32:55,823 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:32:55,823 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:32:55,823 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:32:55,823 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:32:55,823 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:32:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-09-20 15:32:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-20 15:32:55,850 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:55,852 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:55,854 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 534207900, now seen corresponding path program 1 times [2018-09-20 15:32:55,865 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:55,866 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:32:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:55,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:55,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:55,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:55,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:32:55,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:32:56,003 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:32:56,004 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:56,006 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-09-20 15:32:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:56,036 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2018-09-20 15:32:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:32:56,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-20 15:32:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:56,050 INFO L225 Difference]: With dead ends: 115 [2018-09-20 15:32:56,051 INFO L226 Difference]: Without dead ends: 58 [2018-09-20 15:32:56,055 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:32:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-20 15:32:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-20 15:32:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-20 15:32:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-09-20 15:32:56,102 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 21 [2018-09-20 15:32:56,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:56,102 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-09-20 15:32:56,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:32:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-09-20 15:32:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-20 15:32:56,106 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:56,106 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:56,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash -18702094, now seen corresponding path program 1 times [2018-09-20 15:32:56,107 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:56,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2018-09-20 15:32:56,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:32:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:56,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:56,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:56,300 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:56,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:32:56,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:32:56,305 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:32:56,305 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:56,306 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 4 states. [2018-09-20 15:32:56,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:32:56,411 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-09-20 15:32:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:32:56,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-09-20 15:32:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:32:56,422 INFO L225 Difference]: With dead ends: 84 [2018-09-20 15:32:56,423 INFO L226 Difference]: Without dead ends: 61 [2018-09-20 15:32:56,424 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:32:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-20 15:32:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-20 15:32:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-20 15:32:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-09-20 15:32:56,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 34 [2018-09-20 15:32:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:32:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-09-20 15:32:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:32:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-09-20 15:32:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-20 15:32:56,446 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:32:56,446 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:32:56,447 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:32:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 270058899, now seen corresponding path program 1 times [2018-09-20 15:32:56,448 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:32:56,449 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:32:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:32:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:32:56,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:32:56,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:32:56,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:32:56,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:56,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:56,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:56,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:32:56,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:32:56,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:32:56,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:32:57,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:32:57,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:32:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:32:57,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:32:57,700 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:32:57,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:32:57,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:32:57,701 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:32:57,705 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:32:57,706 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 10 states. [2018-09-20 15:32:58,726 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:32:58,943 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:33:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:00,507 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2018-09-20 15:33:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:33:00,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-09-20 15:33:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:00,510 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:33:00,510 INFO L226 Difference]: Without dead ends: 63 [2018-09-20 15:33:00,512 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-20 15:33:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-20 15:33:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:33:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-09-20 15:33:00,524 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 35 [2018-09-20 15:33:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:00,524 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-09-20 15:33:00,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:33:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-09-20 15:33:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-20 15:33:00,526 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:00,527 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:00,527 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -154338930, now seen corresponding path program 1 times [2018-09-20 15:33:00,528 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:00,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:00,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:00,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:00,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:00,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:33:00,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:33:00,648 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:33:00,648 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:00,648 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-09-20 15:33:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:00,711 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2018-09-20 15:33:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:33:00,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-09-20 15:33:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:00,717 INFO L225 Difference]: With dead ends: 89 [2018-09-20 15:33:00,717 INFO L226 Difference]: Without dead ends: 66 [2018-09-20 15:33:00,718 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-20 15:33:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-09-20 15:33:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:33:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-09-20 15:33:00,729 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 36 [2018-09-20 15:33:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:00,730 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-09-20 15:33:00,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:33:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-09-20 15:33:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-20 15:33:00,731 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:00,732 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:00,732 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1211823761, now seen corresponding path program 1 times [2018-09-20 15:33:00,734 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:00,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:33:00,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:33:00,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:00,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:00,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:00,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:33:00,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:33:00,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:33:00,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:00,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:00,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:00,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:33:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:33:01,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:01,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:01,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:33:01,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:33:01,260 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:33:01,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:33:01,261 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 10 states. [2018-09-20 15:33:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:03,165 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2018-09-20 15:33:03,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:33:03,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-09-20 15:33:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:03,168 INFO L225 Difference]: With dead ends: 90 [2018-09-20 15:33:03,168 INFO L226 Difference]: Without dead ends: 62 [2018-09-20 15:33:03,169 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-20 15:33:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-09-20 15:33:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-20 15:33:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-09-20 15:33:03,178 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 37 [2018-09-20 15:33:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:03,179 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-09-20 15:33:03,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:33:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-09-20 15:33:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-20 15:33:03,182 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:03,182 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:03,183 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 353008393, now seen corresponding path program 1 times [2018-09-20 15:33:03,183 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2018-09-20 15:33:03,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:03,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:33:03,325 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:03,340 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:03,340 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:33:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:33:03,341 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:33:03,341 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:03,343 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2018-09-20 15:33:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:03,435 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-09-20 15:33:03,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:33:03,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-09-20 15:33:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:03,438 INFO L225 Difference]: With dead ends: 86 [2018-09-20 15:33:03,439 INFO L226 Difference]: Without dead ends: 63 [2018-09-20 15:33:03,440 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-20 15:33:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-20 15:33:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:33:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-09-20 15:33:03,447 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 54 [2018-09-20 15:33:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:03,448 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-09-20 15:33:03,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:33:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-09-20 15:33:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-20 15:33:03,451 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:03,451 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:03,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1732178434, now seen corresponding path program 1 times [2018-09-20 15:33:03,453 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:03,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:03,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:33:03,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:33:03,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:03,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:33:03,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:33:03,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:33:03,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:03,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:03,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:33:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:33:04,404 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:04,414 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:04,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:33:04,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:33:04,415 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:33:04,416 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:33:04,416 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 10 states. [2018-09-20 15:33:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:06,363 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-09-20 15:33:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:33:06,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-09-20 15:33:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:06,366 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:33:06,366 INFO L226 Difference]: Without dead ends: 63 [2018-09-20 15:33:06,370 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-20 15:33:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-20 15:33:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:33:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-09-20 15:33:06,378 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 55 [2018-09-20 15:33:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:06,379 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-09-20 15:33:06,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:33:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-09-20 15:33:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-20 15:33:06,381 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:06,381 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:06,382 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2057904238, now seen corresponding path program 1 times [2018-09-20 15:33:06,382 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:06,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:06,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:06,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:33:06,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:06,683 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:06,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 15:33:06,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 15:33:06,685 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 15:33:06,685 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:33:06,685 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2018-09-20 15:33:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:06,843 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-09-20 15:33:06,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:33:06,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-09-20 15:33:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:06,845 INFO L225 Difference]: With dead ends: 87 [2018-09-20 15:33:06,845 INFO L226 Difference]: Without dead ends: 63 [2018-09-20 15:33:06,846 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 15:33:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-20 15:33:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-20 15:33:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-20 15:33:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-09-20 15:33:06,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 56 [2018-09-20 15:33:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:06,854 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-09-20 15:33:06,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 15:33:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-09-20 15:33:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-20 15:33:06,860 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:06,860 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:06,861 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1248557612, now seen corresponding path program 1 times [2018-09-20 15:33:06,861 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:06,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-09-20 15:33:06,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:06,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:33:07,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:07,121 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:07,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-20 15:33:07,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-20 15:33:07,123 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-20 15:33:07,123 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-20 15:33:07,123 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 8 states. [2018-09-20 15:33:07,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:07,596 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-09-20 15:33:07,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-20 15:33:07,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-09-20 15:33:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:07,597 INFO L225 Difference]: With dead ends: 70 [2018-09-20 15:33:07,598 INFO L226 Difference]: Without dead ends: 67 [2018-09-20 15:33:07,598 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:33:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-20 15:33:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-20 15:33:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-20 15:33:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-09-20 15:33:07,607 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 56 [2018-09-20 15:33:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:07,608 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-09-20 15:33:07,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-20 15:33:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-09-20 15:33:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-20 15:33:07,611 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:07,612 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:07,612 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:07,612 INFO L82 PathProgramCache]: Analyzing trace with hash 750722725, now seen corresponding path program 1 times [2018-09-20 15:33:07,613 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:07,614 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:07,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:07,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:33:07,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:07,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:07,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:33:07,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:33:07,767 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:33:07,767 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:07,768 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 4 states. [2018-09-20 15:33:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:07,799 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-09-20 15:33:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:33:07,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-09-20 15:33:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:07,801 INFO L225 Difference]: With dead ends: 91 [2018-09-20 15:33:07,801 INFO L226 Difference]: Without dead ends: 68 [2018-09-20 15:33:07,801 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:33:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-20 15:33:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2018-09-20 15:33:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-20 15:33:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-09-20 15:33:07,808 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 56 [2018-09-20 15:33:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:07,808 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-09-20 15:33:07,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:33:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-09-20 15:33:07,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-20 15:33:07,811 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:07,811 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:07,811 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -395687202, now seen corresponding path program 1 times [2018-09-20 15:33:07,813 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:07,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:33:07,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:33:07,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-20 15:33:07,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:33:07,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:08,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:08,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:08,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:33:08,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:33:08,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:33:08,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:33:08,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:33:08,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:33:08,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:33:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:33:08,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:33:08,437 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:33:08,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:33:08,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:33:08,437 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:33:08,437 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:33:08,438 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 10 states. [2018-09-20 15:33:11,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:33:11,359 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-09-20 15:33:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:33:11,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-09-20 15:33:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:33:11,362 INFO L225 Difference]: With dead ends: 90 [2018-09-20 15:33:11,362 INFO L226 Difference]: Without dead ends: 57 [2018-09-20 15:33:11,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:33:11,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-20 15:33:11,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-20 15:33:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-20 15:33:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-20 15:33:11,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 57 [2018-09-20 15:33:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:33:11,367 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-20 15:33:11,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:33:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-20 15:33:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-20 15:33:11,370 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:33:11,370 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:33:11,370 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:33:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -161364143, now seen corresponding path program 1 times [2018-09-20 15:33:11,371 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:33:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-20 15:33:11,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:33:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:33:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:33:11,805 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:33:11,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:33:11 BoogieIcfgContainer [2018-09-20 15:33:11,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:33:11,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:33:11,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:33:11,923 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:33:11,924 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:32:55" (3/4) ... [2018-09-20 15:33:11,930 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-09-20 15:33:12,116 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:33:12,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:33:12,120 INFO L168 Benchmark]: Toolchain (without parser) took 17604.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 950.5 MB in the beginning and 987.0 MB in the end (delta: -36.5 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:33:12,124 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:33:12,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.06 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:33:12,125 INFO L168 Benchmark]: Boogie Preprocessor took 92.49 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:33:12,126 INFO L168 Benchmark]: RCFGBuilder took 794.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:33:12,126 INFO L168 Benchmark]: TraceAbstraction took 16181.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 125.6 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2018-09-20 15:33:12,127 INFO L168 Benchmark]: Witness Printer took 193.15 ms. Allocated memory is still 1.2 GB. Free memory was 987.0 MB in the beginning and 987.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-09-20 15:33:12,131 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.06 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.49 ms. Allocated memory is still 1.0 GB. Free memory was 939.8 MB in the beginning and 934.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 794.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16181.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 987.0 MB in the end (delta: 125.6 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. * Witness Printer took 193.15 ms. Allocated memory is still 1.2 GB. Free memory was 987.0 MB in the beginning and 987.0 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 80]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L74] double x = -0.0; [L75] double y = 0.0; VAL [x=0.0, y=0.0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0.0, \old(y)=0.0] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=0.0, ew_u={2:0}, x=0.0] [L23] FCALL ew_u.value = (x) VAL [\old(x)=0.0, ew_u={2:0}, x=0.0] [L24] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=0.0, ew_u={2:0}, ew_u.parts.msw=-2147483648, x=0.0] [L24] (msw) = ew_u.parts.msw VAL [\old(x)=0.0, ew_u={2:0}, ew_u.parts.msw=-2147483648, msw=-2147483648, x=0.0] [L24] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=0.0, \old(x)=0.0, ew_u={2:0}, ew_u.parts.msw=-2147483648, msw=-2147483648, x=0.0] [L25] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=0.0, ew_u={2:0}, ew_u.parts.lsw=0, msw=-2147483648, x=0.0] [L25] (lsw) = ew_u.parts.lsw VAL [\old(x)=0.0, ew_u={2:0}, ew_u.parts.lsw=0, lsw=0, msw=-2147483648, x=0.0] [L25] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=0.0, \old(x)=0.0, ew_u={2:0}, ew_u.parts.lsw=0, lsw=0, msw=-2147483648, x=0.0] [L26] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=-2147483648, x=0.0] [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] RET return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=-2147483648, x=0.0] [L46] EXPR __fpclassify_double(x) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(x)=2, x=0.0, y=0.0] [L46] COND FALSE !(__fpclassify_double(x) == 0) [L48] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L22] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=0.0, ew_u={3:0}, x=0.0] [L23] FCALL ew_u.value = (x) VAL [\old(x)=0.0, ew_u={3:0}, x=0.0] [L24] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=0.0, ew_u={3:0}, ew_u.parts.msw=0, x=0.0] [L24] (msw) = ew_u.parts.msw VAL [\old(x)=0.0, ew_u={3:0}, ew_u.parts.msw=0, msw=0, x=0.0] [L24] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=0.0, \old(x)=0.0, ew_u={3:0}, ew_u.parts.msw=0, msw=0, x=0.0] [L25] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=0.0, ew_u={3:0}, ew_u.parts.lsw=0, msw=0, x=0.0] [L25] (lsw) = ew_u.parts.lsw VAL [\old(x)=0.0, ew_u={3:0}, ew_u.parts.lsw=0, lsw=0, msw=0, x=0.0] [L25] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=0.0, \old(x)=0.0, ew_u={3:0}, ew_u.parts.lsw=0, lsw=0, msw=0, x=0.0] [L26] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=0, x=0.0] [L28-L29] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L30] RET return 2; VAL [\old(x)=0.0, \result=2, lsw=0, msw=0, x=0.0] [L48] EXPR __fpclassify_double(y) VAL [\old(x)=0.0, \old(y)=0.0, __fpclassify_double(y)=2, x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(y) == 0) [L51] COND FALSE, EXPR !(x < y ? x : y) [L51] EXPR x < y ? x : y VAL [\old(x)=0.0, \old(y)=0.0, x=0.0, x < y ? x : y=0.0, y=0.0] [L51] RET return x < y ? x : y; [L76] EXPR fmin_double(x, y) VAL [fmin_double(x, y)=0.0, x=0.0, y=0.0] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] COND TRUE, EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] CALL, EXPR __signbit_double(res) VAL [\old(x)=0.0] [L55] __uint32_t msw; VAL [\old(x)=0.0, x=0.0] [L58] FCALL ieee_double_shape_type gh_u; VAL [\old(x)=0.0, gh_u={3:0}, x=0.0] [L59] FCALL gh_u.value = (x) VAL [\old(x)=0.0, gh_u={3:0}, x=0.0] [L60] EXPR, FCALL gh_u.parts.msw VAL [\old(x)=0.0, gh_u={3:0}, gh_u.parts.msw=0, x=0.0] [L60] (msw) = gh_u.parts.msw VAL [\old(x)=0.0, gh_u={3:0}, gh_u.parts.msw=0, msw=0, x=0.0] [L60] FCALL (msw) = gh_u.parts.msw VAL [(msw) = gh_u.parts.msw=0.0, \old(x)=0.0, gh_u={3:0}, gh_u.parts.msw=0, msw=0, x=0.0] [L61] COND FALSE !(0) VAL [\old(x)=0.0, msw=0, x=0.0] [L63] RET return (msw & 0x80000000) != 0; VAL [\old(x)=0.0, \result=0, msw=0, x=0.0] [L79] EXPR __signbit_double(res) VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=1, x=0.0, y=0.0] [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [__signbit_double(res)=0, res=0.0, res == -0.0 && __signbit_double(res) == 1=0, x=0.0, y=0.0] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=0.0, x=0.0, y=0.0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 65 locations, 1 error locations. UNSAFE Result, 16.1s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 10.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 647 SDtfs, 241 SDslu, 2277 SDs, 0 SdLazy, 845 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 569 NumberOfCodeBlocks, 569 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 486 ConstructedInterpolants, 76 QuantifiedInterpolants, 94437 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 108/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...