./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer --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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer --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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:02:56,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:56,917 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:56,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:56,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:56,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:56,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:56,926 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:56,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:56,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:56,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:56,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:56,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:56,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:56,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:56,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:56,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:56,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:56,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:56,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:56,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:56,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:56,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:56,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:56,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:56,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:56,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:56,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:56,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:56,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:56,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:56,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:56,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:56,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:56,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:56,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:56,944 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:56,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:56,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:56,954 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:56,954 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:56,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:56,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:56,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:56,955 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:56,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:56,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:56,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:56,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:56,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:56,957 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:56,957 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:56,957 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:56,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:56,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:56,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:56,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:56,958 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer 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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-11-23 13:02:56,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:56,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:56,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:56,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:56,993 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:56,993 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 13:02:57,027 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/2fa1d0517/01cf68978aab461fa8082eb185d824bf/FLAGccb20aa0e [2018-11-23 13:02:57,331 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:57,332 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 13:02:57,336 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/2fa1d0517/01cf68978aab461fa8082eb185d824bf/FLAGccb20aa0e [2018-11-23 13:02:57,346 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/2fa1d0517/01cf68978aab461fa8082eb185d824bf [2018-11-23 13:02:57,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:57,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:57,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:57,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:57,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:57,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1528b193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57, skipping insertion in model container [2018-11-23 13:02:57,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:57,375 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:57,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:57,491 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:57,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:57,521 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:57,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57 WrapperNode [2018-11-23 13:02:57,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:57,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:57,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:57,522 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:57,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:57,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:57,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:57,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:57,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... [2018-11-23 13:02:57,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:57,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:57,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:57,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:57,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:02:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:57,631 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 13:02:57,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 13:02:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 13:02:57,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 13:02:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 13:02:57,632 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 13:02:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:57,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:02:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:02:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:57,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:02:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:02:57,856 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:57,856 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:02:57,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:57 BoogieIcfgContainer [2018-11-23 13:02:57,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:57,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:57,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:57,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:57,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:57" (1/3) ... [2018-11-23 13:02:57,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f437ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:57, skipping insertion in model container [2018-11-23 13:02:57,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:57" (2/3) ... [2018-11-23 13:02:57,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f437ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:57, skipping insertion in model container [2018-11-23 13:02:57,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:57" (3/3) ... [2018-11-23 13:02:57,863 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-11-23 13:02:57,869 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:57,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 13:02:57,885 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 13:02:57,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:57,906 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:57,907 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:57,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:57,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:57,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:57,907 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:57,907 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:57,907 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-23 13:02:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:02:57,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:57,928 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:02:57,929 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:57,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash -388929614, now seen corresponding path program 1 times [2018-11-23 13:02:57,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:57,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:57,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:02:58,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:58,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:58,055 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-23 13:02:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:58,076 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2018-11-23 13:02:58,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:58,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 13:02:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:58,085 INFO L225 Difference]: With dead ends: 109 [2018-11-23 13:02:58,085 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:02:58,088 INFO L631 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-11-23 13:02:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:02:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 13:02:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:02:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 13:02:58,120 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 13:02:58,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:58,121 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 13:02:58,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 13:02:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:02:58,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,124 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:02:58,124 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 689386628, now seen corresponding path program 1 times [2018-11-23 13:02:58,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:02:58,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:58,193 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 13:02:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:58,267 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2018-11-23 13:02:58,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:58,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-23 13:02:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:58,268 INFO L225 Difference]: With dead ends: 112 [2018-11-23 13:02:58,268 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:02:58,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:02:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-23 13:02:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:02:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2018-11-23 13:02:58,278 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2018-11-23 13:02:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:58,278 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2018-11-23 13:02:58,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2018-11-23 13:02:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:02:58,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,279 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:02:58,280 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash 644534487, now seen corresponding path program 1 times [2018-11-23 13:02:58,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:02:58,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:58,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:58,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:58,329 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 4 states. [2018-11-23 13:02:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:58,357 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 13:02:58,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:58,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 13:02:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:58,359 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:02:58,359 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:02:58,360 INFO L631 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-11-23 13:02:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:02:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:02:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:02:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 13:02:58,365 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 42 [2018-11-23 13:02:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 13:02:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 13:02:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:02:58,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,366 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-11-23 13:02:58,367 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash 768889016, now seen corresponding path program 1 times [2018-11-23 13:02:58,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:02:58,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:02:58,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:58,421 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 4 states. [2018-11-23 13:02:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:58,440 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2018-11-23 13:02:58,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:58,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-23 13:02:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:58,442 INFO L225 Difference]: With dead ends: 93 [2018-11-23 13:02:58,442 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:02:58,442 INFO L631 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-11-23 13:02:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:02:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-23 13:02:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:02:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 13:02:58,448 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 45 [2018-11-23 13:02:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:58,448 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 13:02:58,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 13:02:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:02:58,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,449 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1] [2018-11-23 13:02:58,449 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash 258354839, now seen corresponding path program 1 times [2018-11-23 13:02:58,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:02:58,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:02:58,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:02:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:02:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:58,482 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 3 states. [2018-11-23 13:02:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:58,499 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-23 13:02:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:02:58,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 13:02:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:58,501 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:02:58,501 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:02:58,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:02:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 13:02:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:02:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2018-11-23 13:02:58,507 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 45 [2018-11-23 13:02:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:58,507 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-23 13:02:58,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:02:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-23 13:02:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:02:58,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:58,509 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2018-11-23 13:02:58,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:58,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2126980749, now seen corresponding path program 1 times [2018-11-23 13:02:58,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:58,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:58,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:58,565 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2139095048, |#NULL.offset|=2139095042, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] RET #134#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret23 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := #t~nondet8;havoc #t~nondet8; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #138#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1] [?] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;#t~short11 := 0 != #t~ret9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] CALL call #t~ret10 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #140#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;#t~short11 := 0 == #t~ret10; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] #t~short15 := #t~short11; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true, |main_#t~short15|=true] [?] assume #t~short15; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true, |main_#t~short15|=true] [?] assume #t~short15;havoc #t~short15;havoc #t~ret12;havoc #t~ret9;havoc #t~short14;havoc #t~short11;havoc #t~ret10;havoc #t~ret13; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] RET #130#return; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#res|=2139095043.0] [?] assume true; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#res|=2139095043.0] [?] RET #146#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=2139095043.0] [?] ~res~0 := #t~ret16;havoc #t~ret16; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #148#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647;#t~short19 := 0 != #t~ret17; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~short19|=true] [?] assume #t~short19; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~short19|=true] [?] CALL call #t~ret18 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #150#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~ret18|=0, |main_#t~short19|=true] [?] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647;#t~short19 := 0 == #t~ret18; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~ret18|=0, |main_#t~short19|=true] [?] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0);havoc #t~ret17;havoc #t~short19;havoc #t~ret18; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] assume #t~short15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L84] assume #t~short15; [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L16] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L17] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] ~w~0 := #t~mem0; [L18] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L16] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21-L32] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L32] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L32] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L32] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L12-L33] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36-L37] assume 0 == #t~ret2; [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L35-L42] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74-L77] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] assume #t~short15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L84] assume #t~short15; [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L16] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L17] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] ~w~0 := #t~mem0; [L18] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L16] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21-L32] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L32] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L32] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L32] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L12-L33] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36-L37] assume 0 == #t~ret2; [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L35-L42] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74-L77] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68-L69] havoc #t~short15; [L69] havoc #t~ret12; [L68] havoc #t~ret9; [L69] havoc #t~short14; [L68] havoc #t~short11; [L68] havoc #t~ret10; [L69] havoc #t~ret13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L68] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L68] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L68] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L68] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L71] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L13] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L71] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095043, x=2139095044, y=2139095043] [L71] float res = fmin_float(x, y); [L74] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L74] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L74] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L74] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] ----- [2018-11-23 13:02:58,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:58 BoogieIcfgContainer [2018-11-23 13:02:58,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:58,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:58,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:58,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:58,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:57" (3/4) ... [2018-11-23 13:02:58,625 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:02:58,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:58,626 INFO L168 Benchmark]: Toolchain (without parser) took 1277.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -67.8 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:02:58,627 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:02:58,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.85 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:02:58,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.96 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:02:58,628 INFO L168 Benchmark]: Boogie Preprocessor took 57.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:02:58,629 INFO L168 Benchmark]: RCFGBuilder took 260.65 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:02:58,630 INFO L168 Benchmark]: TraceAbstraction took 763.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:02:58,630 INFO L168 Benchmark]: Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:02:58,633 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.85 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.96 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.65 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 763.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L68] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L68] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L68] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L68] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L71] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L13] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L71] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095043, x=2139095044, y=2139095043] [L71] float res = fmin_float(x, y); [L74] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L74] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L74] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L74] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 2 error locations. UNSAFE Result, 0.7s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 16 SDslu, 523 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, 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, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 8870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 33/33 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-aa41828 [2018-11-23 13:03:00,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:00,073 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:00,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:00,081 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:00,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:00,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:00,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:00,084 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:00,085 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:00,086 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:00,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:00,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:00,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:00,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:00,088 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:00,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:00,090 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:00,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:00,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:00,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:00,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:00,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:00,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:00,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:00,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:00,097 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:00,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:00,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:00,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:00,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:00,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:00,098 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:00,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:00,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:00,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:00,100 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:03:00,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:00,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:00,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:00,110 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:00,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:00,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:00,111 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:00,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:00,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:00,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:00,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:00,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:00,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:00,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:00,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:00,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:00,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:00,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:00,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:00,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:00,114 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:03:00,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:00,114 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:03:00,114 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:03:00,114 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer 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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-11-23 13:03:00,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:00,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:00,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:00,156 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:00,156 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:00,157 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 13:03:00,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/300340a32/38b177fb34184a4390561b6f76850f79/FLAG08887d01d [2018-11-23 13:03:00,486 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:00,486 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 13:03:00,490 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/300340a32/38b177fb34184a4390561b6f76850f79/FLAG08887d01d [2018-11-23 13:03:00,499 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/data/300340a32/38b177fb34184a4390561b6f76850f79 [2018-11-23 13:03:00,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:00,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:00,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:00,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:00,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:00,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00, skipping insertion in model container [2018-11-23 13:03:00,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:00,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:00,646 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:00,650 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:00,669 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:00,685 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:00,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00 WrapperNode [2018-11-23 13:03:00,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:00,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:00,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:00,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:00,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:00,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:00,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:00,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:00,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... [2018-11-23 13:03:00,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:00,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:00,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:00,732 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:00,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 13:03:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 13:03:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 13:03:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:00,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:00,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:03:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:00,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 13:03:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:01,018 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:03:01,046 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:01,046 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:03:01,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:01 BoogieIcfgContainer [2018-11-23 13:03:01,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:01,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:01,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:01,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:01,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:00" (1/3) ... [2018-11-23 13:03:01,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ce7e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:01, skipping insertion in model container [2018-11-23 13:03:01,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:00" (2/3) ... [2018-11-23 13:03:01,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ce7e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:01, skipping insertion in model container [2018-11-23 13:03:01,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:01" (3/3) ... [2018-11-23 13:03:01,052 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-11-23 13:03:01,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:01,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 13:03:01,077 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 13:03:01,098 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:01,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:01,099 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:01,099 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:01,099 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:01,099 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:01,099 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:01,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:01,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-23 13:03:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:03:01,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,117 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:03:01,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1017347723, now seen corresponding path program 1 times [2018-11-23 13:03:01,126 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:01,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:01,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:01,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:01,238 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-23 13:03:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,257 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-23 13:03:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:01,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-23 13:03:01,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,264 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:03:01,264 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:03:01,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 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-11-23 13:03:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:03:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 13:03:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:03:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-11-23 13:03:01,298 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 35 [2018-11-23 13:03:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,300 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-11-23 13:03:01,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-11-23 13:03:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:03:01,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,302 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 13:03:01,303 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1223757215, now seen corresponding path program 1 times [2018-11-23 13:03:01,303 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,304 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:01,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:01,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:01,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:01,400 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 4 states. [2018-11-23 13:03:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,446 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2018-11-23 13:03:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:01,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 13:03:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,448 INFO L225 Difference]: With dead ends: 108 [2018-11-23 13:03:01,448 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:03:01,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:03:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-11-23 13:03:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:03:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 13:03:01,458 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 13:03:01,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,458 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 13:03:01,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 13:03:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:03:01,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,459 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:03:01,459 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash 435900908, now seen corresponding path program 1 times [2018-11-23 13:03:01,460 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,460 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:01,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:01,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:01,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:01,544 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 13:03:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,588 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-23 13:03:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:01,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 13:03:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,590 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:03:01,591 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 13:03:01,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-11-23 13:03:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 13:03:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 13:03:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 13:03:01,596 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2018-11-23 13:03:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,597 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 13:03:01,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 13:03:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:03:01,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,598 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:03:01,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -588522803, now seen corresponding path program 1 times [2018-11-23 13:03:01,599 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,599 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:01,663 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:01,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:01,671 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 13:03:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,702 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 13:03:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:01,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 13:03:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,704 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:03:01,704 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:03:01,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-11-23 13:03:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:03:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 13:03:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 13:03:01,709 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 42 [2018-11-23 13:03:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,710 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 13:03:01,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 13:03:01,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:03:01,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,711 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:03:01,711 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,711 INFO L82 PathProgramCache]: Analyzing trace with hash -545646832, now seen corresponding path program 1 times [2018-11-23 13:03:01,712 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,712 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:01,777 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:01,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:01,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:01,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:01,787 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 13:03:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,806 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 13:03:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:01,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 13:03:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,808 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:03:01,808 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:03:01,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-11-23 13:03:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:03:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 13:03:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 13:03:01,815 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 43 [2018-11-23 13:03:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,815 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 13:03:01,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 13:03:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:03:01,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,817 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:03:01,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1776219087, now seen corresponding path program 1 times [2018-11-23 13:03:01,817 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:01,863 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:01,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:01,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:01,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:01,871 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 13:03:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:01,888 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 13:03:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:01,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 13:03:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:01,889 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:03:01,889 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:03:01,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-11-23 13:03:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:03:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 13:03:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 13:03:01,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 44 [2018-11-23 13:03:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:01,894 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 13:03:01,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 13:03:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:03:01,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:01,895 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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-11-23 13:03:01,895 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:01,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash -268667278, now seen corresponding path program 1 times [2018-11-23 13:03:01,895 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:01,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:01,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:02,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:02,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:02,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-23 13:03:02,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:02,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:02,354 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 13 states. [2018-11-23 13:03:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:02,746 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2018-11-23 13:03:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:02,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 13:03:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:02,747 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:03:02,747 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 13:03:02,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:03:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 13:03:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2018-11-23 13:03:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 13:03:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2018-11-23 13:03:02,754 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 44 [2018-11-23 13:03:02,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:02,754 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2018-11-23 13:03:02,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2018-11-23 13:03:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:03:02,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:02,755 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2018-11-23 13:03:02,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:02,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1115369263, now seen corresponding path program 1 times [2018-11-23 13:03:02,756 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:02,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:02,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:02,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:02,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:02,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:02,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:03:02,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:02,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:02,895 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand 8 states. [2018-11-23 13:03:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:03,162 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2018-11-23 13:03:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:03,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 13:03:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:03,164 INFO L225 Difference]: With dead ends: 133 [2018-11-23 13:03:03,164 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:03:03,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:03:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2018-11-23 13:03:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 13:03:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2018-11-23 13:03:03,174 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 46 [2018-11-23 13:03:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:03,182 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2018-11-23 13:03:03,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2018-11-23 13:03:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:03:03,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:03,183 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2018-11-23 13:03:03,184 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:03,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2005906004, now seen corresponding path program 1 times [2018-11-23 13:03:03,186 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:03,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:03:03,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:03,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:03,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:03,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:03,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:03,249 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand 3 states. [2018-11-23 13:03:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:03,259 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2018-11-23 13:03:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:03,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 13:03:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:03,260 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:03:03,260 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:03:03,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:03:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-23 13:03:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:03:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2018-11-23 13:03:03,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 51 [2018-11-23 13:03:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:03,268 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2018-11-23 13:03:03,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2018-11-23 13:03:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:03,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:03,269 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:03,269 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:03,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:03,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1686772588, now seen corresponding path program 1 times [2018-11-23 13:03:03,270 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:03,270 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:03,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:03,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:03,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:03,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:03,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-23 13:03:03,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:03,677 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 12 states. [2018-11-23 13:03:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:03,973 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2018-11-23 13:03:03,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:03,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-23 13:03:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:03,975 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:03:03,975 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:03:03,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:03:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2018-11-23 13:03:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 13:03:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2018-11-23 13:03:03,982 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 56 [2018-11-23 13:03:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:03,982 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2018-11-23 13:03:03,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2018-11-23 13:03:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:03:03,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:03,983 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-23 13:03:03,984 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:03,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:03,984 INFO L82 PathProgramCache]: Analyzing trace with hash 798294838, now seen corresponding path program 1 times [2018-11-23 13:03:03,984 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:03,984 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:04,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:03:04,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:03:04,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:04,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 13:03:04,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:03:04,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:03:04,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:03:04,474 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand 19 states. [2018-11-23 13:03:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:05,149 INFO L93 Difference]: Finished difference Result 116 states and 150 transitions. [2018-11-23 13:03:05,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:03:05,149 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-11-23 13:03:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:05,150 INFO L225 Difference]: With dead ends: 116 [2018-11-23 13:03:05,150 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 13:03:05,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:03:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 13:03:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2018-11-23 13:03:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:03:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2018-11-23 13:03:05,158 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 49 [2018-11-23 13:03:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:05,159 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2018-11-23 13:03:05,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:03:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2018-11-23 13:03:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:05,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:05,159 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:05,160 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:05,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1349420364, now seen corresponding path program 1 times [2018-11-23 13:03:05,160 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:05,160 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/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-11-23 13:03:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:05,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:03:05,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:05,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:05,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-23 13:03:05,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:03:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:03:05,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:03:05,479 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand 14 states. [2018-11-23 13:03:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:05,906 INFO L93 Difference]: Finished difference Result 142 states and 182 transitions. [2018-11-23 13:03:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:03:05,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-11-23 13:03:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:05,907 INFO L225 Difference]: With dead ends: 142 [2018-11-23 13:03:05,907 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:03:05,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:03:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:03:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-11-23 13:03:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 13:03:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2018-11-23 13:03:05,915 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 56 [2018-11-23 13:03:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:05,915 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2018-11-23 13:03:05,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:03:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2018-11-23 13:03:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:03:05,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:05,916 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:05,916 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:05,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -26719360, now seen corresponding path program 1 times [2018-11-23 13:03:05,917 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:05,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:05,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:03:06,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:06,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-11-23 13:03:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:06,206 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand 12 states. [2018-11-23 13:03:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,465 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2018-11-23 13:03:06,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:06,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-23 13:03:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:06,466 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:03:06,466 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:03:06,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:06,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:03:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-11-23 13:03:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:03:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2018-11-23 13:03:06,471 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 58 [2018-11-23 13:03:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:06,472 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2018-11-23 13:03:06,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2018-11-23 13:03:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:03:06,472 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:06,473 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-23 13:03:06,473 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:06,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -335762184, now seen corresponding path program 1 times [2018-11-23 13:03:06,473 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:06,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:06,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:06,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:06,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:06,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:06,532 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand 4 states. [2018-11-23 13:03:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,543 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2018-11-23 13:03:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:06,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-23 13:03:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:06,545 INFO L225 Difference]: With dead ends: 116 [2018-11-23 13:03:06,545 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 13:03:06,545 INFO L631 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-11-23 13:03:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 13:03:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 13:03:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 13:03:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-23 13:03:06,551 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 54 [2018-11-23 13:03:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:06,552 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-23 13:03:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 13:03:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:03:06,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:06,553 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1] [2018-11-23 13:03:06,553 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:06,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1557840485, now seen corresponding path program 1 times [2018-11-23 13:03:06,554 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:06,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:06,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:06,644 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:06,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:06,652 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 4 states. [2018-11-23 13:03:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,669 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2018-11-23 13:03:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:06,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-23 13:03:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:06,671 INFO L225 Difference]: With dead ends: 119 [2018-11-23 13:03:06,671 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:03:06,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-11-23 13:03:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:03:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-23 13:03:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 13:03:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-23 13:03:06,678 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 55 [2018-11-23 13:03:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:06,678 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-23 13:03:06,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-23 13:03:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:06,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:06,678 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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-11-23 13:03:06,679 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:06,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash -931228901, now seen corresponding path program 1 times [2018-11-23 13:03:06,679 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:06,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:06,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:06,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 13:03:06,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:06,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 13:03:06,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:06,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:06,868 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 11 states. [2018-11-23 13:03:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,674 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2018-11-23 13:03:07,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:07,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 13:03:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:07,675 INFO L225 Difference]: With dead ends: 121 [2018-11-23 13:03:07,675 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 13:03:07,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 13:03:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2018-11-23 13:03:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:03:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-11-23 13:03:07,681 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 56 [2018-11-23 13:03:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:07,681 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-11-23 13:03:07,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-11-23 13:03:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:07,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:07,682 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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-11-23 13:03:07,682 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:07,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1062915805, now seen corresponding path program 1 times [2018-11-23 13:03:07,683 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:07,683 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:07,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:07,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:08,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:08,020 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:08,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:08,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:08,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:08,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:03:08,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:08,231 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 8 states. [2018-11-23 13:03:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:08,772 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2018-11-23 13:03:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:08,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-23 13:03:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:08,772 INFO L225 Difference]: With dead ends: 119 [2018-11-23 13:03:08,772 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 13:03:08,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 13:03:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2018-11-23 13:03:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 13:03:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-23 13:03:08,779 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 56 [2018-11-23 13:03:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:08,779 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-23 13:03:08,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2018-11-23 13:03:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:08,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:08,780 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1] [2018-11-23 13:03:08,781 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:08,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1505315820, now seen corresponding path program 1 times [2018-11-23 13:03:08,781 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:08,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:08,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:08,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:08,829 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:08,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:08,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:08,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:08,837 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 4 states. [2018-11-23 13:03:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:08,847 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-11-23 13:03:08,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:08,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 13:03:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:08,847 INFO L225 Difference]: With dead ends: 127 [2018-11-23 13:03:08,847 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 13:03:08,848 INFO L631 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-11-23 13:03:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 13:03:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-23 13:03:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 13:03:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2018-11-23 13:03:08,854 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 56 [2018-11-23 13:03:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2018-11-23 13:03:08,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2018-11-23 13:03:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:03:08,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:08,856 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:08,856 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:08,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 965908574, now seen corresponding path program 1 times [2018-11-23 13:03:08,856 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:08,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:03:08,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:09,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:09,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-23 13:03:09,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:09,124 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 13 states. [2018-11-23 13:03:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:09,455 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2018-11-23 13:03:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:09,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-23 13:03:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:09,456 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:03:09,456 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 13:03:09,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:03:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 13:03:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-23 13:03:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 13:03:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2018-11-23 13:03:09,462 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 56 [2018-11-23 13:03:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:09,463 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2018-11-23 13:03:09,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2018-11-23 13:03:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 13:03:09,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:09,464 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:09,464 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:09,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1712579960, now seen corresponding path program 1 times [2018-11-23 13:03:09,464 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:09,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:09,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 13:03:09,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:10,540 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 13:03:10,741 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 13:03:10,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:10,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:10,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:03:11,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:11,557 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 13:03:11,725 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 13:03:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 17 [2018-11-23 13:03:12,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:03:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:03:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:03:12,005 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand 17 states. [2018-11-23 13:03:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,477 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2018-11-23 13:03:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:03:13,478 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-23 13:03:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:13,478 INFO L225 Difference]: With dead ends: 114 [2018-11-23 13:03:13,478 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 13:03:13,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 13:03:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 13:03:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 13:03:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2018-11-23 13:03:13,483 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 63 [2018-11-23 13:03:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:13,483 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2018-11-23 13:03:13,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:03:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2018-11-23 13:03:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:03:13,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:13,484 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-23 13:03:13,484 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:13,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2049769800, now seen corresponding path program 1 times [2018-11-23 13:03:13,484 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:03:13,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:03:14,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:14,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 13:03:14,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:03:14,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:03:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:03:14,044 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand 21 states. [2018-11-23 13:03:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,664 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2018-11-23 13:03:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:03:14,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-23 13:03:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:14,665 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:03:14,665 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 13:03:14,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 13:03:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-23 13:03:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:03:14,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-11-23 13:03:14,669 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 57 [2018-11-23 13:03:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:14,669 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-11-23 13:03:14,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:03:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-11-23 13:03:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:03:14,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:14,670 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-23 13:03:14,670 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash 685789633, now seen corresponding path program 1 times [2018-11-23 13:03:14,670 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:14,671 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 13:03:14,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:14,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:14,734 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 4 states. [2018-11-23 13:03:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,743 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-23 13:03:14,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:14,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-23 13:03:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:14,745 INFO L225 Difference]: With dead ends: 111 [2018-11-23 13:03:14,745 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 13:03:14,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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-11-23 13:03:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 13:03:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-11-23 13:03:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 13:03:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2018-11-23 13:03:14,751 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 57 [2018-11-23 13:03:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:14,751 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2018-11-23 13:03:14,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2018-11-23 13:03:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 13:03:14,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:14,752 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-23 13:03:14,752 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 276965408, now seen corresponding path program 1 times [2018-11-23 13:03:14,752 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:14,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:15,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:15,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:15,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 13:03:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:03:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:03:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:15,194 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand 15 states. [2018-11-23 13:03:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,277 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-23 13:03:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:03:16,277 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 13:03:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,278 INFO L225 Difference]: With dead ends: 107 [2018-11-23 13:03:16,278 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:03:16,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:03:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:03:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-11-23 13:03:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:03:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-23 13:03:16,283 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 57 [2018-11-23 13:03:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:16,283 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-23 13:03:16,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:03:16,283 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-23 13:03:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:03:16,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:16,283 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:16,283 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:16,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -820099601, now seen corresponding path program 1 times [2018-11-23 13:03:16,284 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:16,284 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:16,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:03:16,460 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:16,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:03:16,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:16,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:16,468 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 12 states. [2018-11-23 13:03:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,940 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-23 13:03:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:16,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 13:03:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,941 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:03:16,941 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:03:16,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:03:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 13:03:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:03:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-23 13:03:16,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 70 [2018-11-23 13:03:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:16,944 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-23 13:03:16,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-23 13:03:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 13:03:16,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:16,944 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:16,944 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:16,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -429306586, now seen corresponding path program 1 times [2018-11-23 13:03:16,944 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:16,944 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:16,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:03:17,194 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:03:17,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:17,202 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 12 states. [2018-11-23 13:03:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,824 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 13:03:17,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:17,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 13:03:17,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:17,824 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:03:17,824 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:03:17,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:03:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 13:03:17,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:03:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-11-23 13:03:17,827 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 71 [2018-11-23 13:03:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:17,827 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-11-23 13:03:17,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-11-23 13:03:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 13:03:17,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:17,828 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:17,828 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:17,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:17,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1994702002, now seen corresponding path program 1 times [2018-11-23 13:03:17,828 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:17,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:17,977 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 13:03:17,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 13:03:18,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:18,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 13:03:18,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:03:18,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:03:18,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:18,465 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 17 states. [2018-11-23 13:03:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:19,047 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2018-11-23 13:03:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:19,048 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-11-23 13:03:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:19,048 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:03:19,049 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:03:19,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:03:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:03:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-11-23 13:03:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-11-23 13:03:19,053 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 71 [2018-11-23 13:03:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:19,053 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2018-11-23 13:03:19,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:03:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-23 13:03:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:03:19,054 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:19,054 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:19,054 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:19,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1572781779, now seen corresponding path program 1 times [2018-11-23 13:03:19,054 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:19,054 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:19,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:03:19,319 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:19,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:19,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:03:19,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:19,328 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 12 states. [2018-11-23 13:03:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,149 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2018-11-23 13:03:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:20,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-11-23 13:03:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,150 INFO L225 Difference]: With dead ends: 87 [2018-11-23 13:03:20,150 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:03:20,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:03:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 13:03:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:03:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2018-11-23 13:03:20,155 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 72 [2018-11-23 13:03:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,155 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2018-11-23 13:03:20,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-23 13:03:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 13:03:20,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,156 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,156 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:20,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1981385, now seen corresponding path program 1 times [2018-11-23 13:03:20,156 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:20,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 13:03:20,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 13:03:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 13:03:20,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:20,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 13:03:20,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:03:20,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:03:20,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:20,565 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 17 states. [2018-11-23 13:03:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,134 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2018-11-23 13:03:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:21,134 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-23 13:03:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,135 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:03:21,135 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:03:21,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:03:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:03:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-23 13:03:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:03:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2018-11-23 13:03:21,139 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 72 [2018-11-23 13:03:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,139 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2018-11-23 13:03:21,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:03:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2018-11-23 13:03:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:03:21,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,139 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,139 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:21,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1985418442, now seen corresponding path program 1 times [2018-11-23 13:03:21,140 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:21,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:03:21,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:21,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:21,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:03:21,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:03:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:03:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:03:21,325 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand 12 states. [2018-11-23 13:03:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,893 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-23 13:03:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:21,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-11-23 13:03:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,894 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:03:21,894 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:03:21,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:03:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 13:03:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:03:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 13:03:21,898 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 73 [2018-11-23 13:03:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,898 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 13:03:21,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:03:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 13:03:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:03:21,899 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:21,899 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:21,899 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:21,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1616447157, now seen corresponding path program 1 times [2018-11-23 13:03:21,899 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:03:21,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2018-11-23 13:03:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 13:03:21,954 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:03:21,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:21,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:03:21,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:21,962 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-11-23 13:03:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:21,968 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 13:03:21,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:21,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-23 13:03:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:21,968 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:03:21,968 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:03:21,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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-11-23 13:03:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:03:21,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:03:21,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:03:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:03:21,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-11-23 13:03:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:21,969 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:03:21,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:21,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:21,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L451 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 35 42) the Hoare annotation is: true [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 35 42) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 35 42) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-11-23 13:03:22,293 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 13:03:22,293 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L444 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:03:22,294 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L444 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret9|) |main_#t~short11| (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 69) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L68-9(lines 68 84) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point L68-11(lines 68 84) no Hoare annotation was computed. [2018-11-23 13:03:22,294 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 59 87) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L444 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (not |main_#t~short11|)) (.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse1 (not |main_#t~short15|))) (or (and .cse0 .cse1 (= (_ bv1 32) |main_#t~ret9|) (= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32)) (not (fp.eq main_~y~0 main_~y~0)) (not .cse2)) (and .cse0 .cse2 .cse1 (= (_ bv0 32) |main_#t~ret9|)))) [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L444 ceAbstractionStarter]: At program point L69-3(line 69) the Hoare annotation is: (and |main_#t~short14| (not |main_#t~short11|) (fp.eq main_~x~0 main_~x~0) (not |main_#t~short15|) (= |main_#t~ret12| (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9|)) [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L69-4(line 69) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L69-6(line 69) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L444 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (let ((.cse1 (fp.eq main_~x~0 main_~x~0)) (.cse0 (fp.eq main_~y~0 main_~y~0))) (or (and (and (= main_~y~0 main_~res~0) .cse0) (not .cse1)) (and (= main_~x~0 main_~res~0) .cse1 (not .cse0)))) [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L444 ceAbstractionStarter]: At program point L74-3(line 74) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short19| (fp.eq main_~y~0 main_~y~0) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L74-4(line 74) no Hoare annotation was computed. [2018-11-23 13:03:22,295 INFO L448 ceAbstractionStarter]: For program point L74-6(lines 74 77) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 59 87) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L444 ceAbstractionStarter]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 59 87) the Hoare annotation is: true [2018-11-23 13:03:22,296 INFO L444 ceAbstractionStarter]: At program point L80(line 80) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L444 ceAbstractionStarter]: At program point L80-3(line 80) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short22| (not (fp.eq main_~y~0 main_~y~0))) [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L80-4(line 80) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L448 ceAbstractionStarter]: For program point L80-6(lines 80 83) no Hoare annotation was computed. [2018-11-23 13:03:22,296 INFO L451 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: true [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2018-11-23 13:03:22,297 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 12 33) the Hoare annotation is: true [2018-11-23 13:03:22,297 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 12 33) no Hoare annotation was computed. [2018-11-23 13:03:22,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:03:22 BoogieIcfgContainer [2018-11-23 13:03:22,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:03:22,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:03:22,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:03:22,308 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:03:22,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:01" (3/4) ... [2018-11-23 13:03:22,312 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:03:22,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-23 13:03:22,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_float [2018-11-23 13:03:22,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:03:22,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:03:22,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 13:03:22,324 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 13:03:22,324 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:03:22,324 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:03:22,346 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 13:03:22,367 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4096f177-e8c2-4302-97d6-4415a81112be/bin-2019/uautomizer/witness.graphml [2018-11-23 13:03:22,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:03:22,368 INFO L168 Benchmark]: Toolchain (without parser) took 21866.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 341.8 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -103.5 MB). Peak memory consumption was 238.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,369 INFO L168 Benchmark]: CDTParser took 0.12 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-11-23 13:03:22,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.58 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:03:22,369 INFO L168 Benchmark]: Boogie Preprocessor took 25.70 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:03:22,370 INFO L168 Benchmark]: RCFGBuilder took 314.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,370 INFO L168 Benchmark]: TraceAbstraction took 21260.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 248.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,370 INFO L168 Benchmark]: Witness Printer took 59.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:03:22,371 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.12 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 183.12 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.58 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.70 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 314.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21260.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 248.4 MB. Max. memory is 11.5 GB. * Witness Printer took 59.42 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 2 error locations. SAFE Result, 21.2s OverallTime, 30 OverallIterations, 6 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2020 SDtfs, 977 SDslu, 10318 SDs, 0 SdLazy, 4686 SolverSat, 240 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2467 GetRequests, 2132 SyntacticMatches, 8 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=17, 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, 30 MinimizatonAttempts, 186 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 153 PreInvPairs, 175 NumberOfFragments, 161 HoareAnnotationTreeSize, 153 FomulaSimplifications, 857 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 69 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2267 ConstructedInterpolants, 32 QuantifiedInterpolants, 431671 SizeOfPredicates, 141 NumberOfNonLiveVariables, 3767 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 41 InterpolantComputations, 19 PerfectInterpolantSequences, 1034/1154 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...