./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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 056bf8e6ba5df6966e0f82320ce36676b5ee3b5e .............................................................................................................................................................................................................................................................................................................. 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_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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 056bf8e6ba5df6966e0f82320ce36676b5ee3b5e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:08:11,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:08:11,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:08:11,145 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:08:11,145 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:08:11,146 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:08:11,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:08:11,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:08:11,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:08:11,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:08:11,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:08:11,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:08:11,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:08:11,153 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:08:11,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:08:11,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:08:11,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:08:11,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:08:11,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:08:11,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:08:11,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:08:11,160 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:08:11,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:08:11,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:08:11,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:08:11,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:08:11,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:08:11,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:08:11,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:08:11,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:08:11,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:08:11,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:08:11,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:08:11,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:08:11,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:08:11,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:08:11,167 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 10:08:11,177 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:08:11,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:08:11,178 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:08:11,178 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:08:11,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:08:11,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:08:11,179 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:08:11,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:08:11,179 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:08:11,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:08:11,180 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:08:11,181 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:08:11,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:08:11,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:08:11,182 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:08:11,182 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:08:11,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:08:11,182 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_dd12058c-a11d-4ef8-a517-6dac39db6b38/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 -> 056bf8e6ba5df6966e0f82320ce36676b5ee3b5e [2018-11-10 10:08:11,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:08:11,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:08:11,215 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:08:11,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:08:11,216 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:08:11,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:11,252 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/4fa79a598/3dae01282434459cb47c05e75b8b7129/FLAG63d0bc9fc [2018-11-10 10:08:11,649 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:08:11,649 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:11,655 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/4fa79a598/3dae01282434459cb47c05e75b8b7129/FLAG63d0bc9fc [2018-11-10 10:08:11,664 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/4fa79a598/3dae01282434459cb47c05e75b8b7129 [2018-11-10 10:08:11,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:08:11,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:08:11,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:11,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:08:11,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:08:11,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd11db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11, skipping insertion in model container [2018-11-10 10:08:11,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:08:11,694 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:08:11,804 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:11,807 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:08:11,825 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:11,834 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:08:11,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11 WrapperNode [2018-11-10 10:08:11,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:11,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:08:11,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:08:11,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:08:11,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... [2018-11-10 10:08:11,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:08:11,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:08:11,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:08:11,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:08:11,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:08:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:08:11,938 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 10:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:08:11,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:08:11,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:08:12,087 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:08:12,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:12 BoogieIcfgContainer [2018-11-10 10:08:12,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:08:12,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:08:12,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:08:12,090 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:08:12,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:08:11" (1/3) ... [2018-11-10 10:08:12,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331ab3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:12, skipping insertion in model container [2018-11-10 10:08:12,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:11" (2/3) ... [2018-11-10 10:08:12,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@331ab3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:12, skipping insertion in model container [2018-11-10 10:08:12,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:12" (3/3) ... [2018-11-10 10:08:12,093 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:12,098 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:08:12,102 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-10 10:08:12,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-10 10:08:12,130 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:08:12,130 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:08:12,131 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:08:12,131 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:08:12,131 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:08:12,131 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:08:12,131 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:08:12,131 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:08:12,131 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:08:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-10 10:08:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:08:12,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:12,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:12,153 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:12,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2113161621, now seen corresponding path program 1 times [2018-11-10 10:08:12,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:08:12,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:08:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:08:12,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:08:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:12,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:08:12,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:08:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:08:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:08:12,278 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-11-10 10:08:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:12,321 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-10 10:08:12,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:08:12,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 10:08:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:12,331 INFO L225 Difference]: With dead ends: 64 [2018-11-10 10:08:12,331 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 10:08:12,333 INFO L605 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-10 10:08:12,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 10:08:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-11-10 10:08:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 10:08:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-10 10:08:12,356 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2018-11-10 10:08:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:12,357 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 10:08:12,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:08:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-10 10:08:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:08:12,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:12,358 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:12,358 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:12,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2118082726, now seen corresponding path program 1 times [2018-11-10 10:08:12,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:08:12,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:08:12,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:08:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:08:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:08:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:08:12,394 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:08:12,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:08:12 BoogieIcfgContainer [2018-11-10 10:08:12,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:08:12,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:08:12,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:08:12,415 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:08:12,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:12" (3/4) ... [2018-11-10 10:08:12,418 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:08:12,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:08:12,419 INFO L168 Benchmark]: Toolchain (without parser) took 752.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:08:12,420 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:08:12,420 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:08:12,420 INFO L168 Benchmark]: Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:08:12,421 INFO L168 Benchmark]: RCFGBuilder took 231.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:08:12,421 INFO L168 Benchmark]: TraceAbstraction took 326.95 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:08:12,422 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:08:12,423 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 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.46 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 326.95 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: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 53]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 36. Possible FailurePath: [L1] int __return_main; [L8] int __tmp_129_0; [L9] int __tmp_129_1; [L10] int __tmp_129_2; [L11] int __return_134; VAL [\old(__return_134)=4, \old(__return_main)=3, \old(__tmp_129_0)=7, \old(__tmp_129_1)=2, \old(__tmp_129_2)=6, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L14] double main__E0; [L15] double main__E1; [L16] double main__S; [L17] int main__i; [L18] main__E1 = 0 [L19] main__S = 0 [L20] main__i = 0 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L21] COND TRUE main__i <= 1000000 [L23] main__E0 = __VERIFIER_nondet_double() [L24] int main____CPAchecker_TMP_0; VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=5, main__i=0] [L25] COND TRUE main__E0 >= -1.0 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=5, main__i=0] [L27] COND TRUE main__E0 <= 1.0 [L29] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=5, main__i=0] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L32] int main____CPAchecker_TMP_1; [L33] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L34] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L36] main__S = 0 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=5, main__i=0] [L38] main__E1 = main__E0 [L39] int main____CPAchecker_TMP_2; VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=5, main__E1=5, main__i=0] [L40] COND FALSE !(main__S >= -10000.0) VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=5, main__E1=5, main__i=0] [L157] main____CPAchecker_TMP_2 = 0 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=5, main__E1=5, main__i=0] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_2 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=5, main__E1=5, main__i=0] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=5, main__E1=5, main__i=0] [L53] __VERIFIER_error() VAL [\old(__return_134)=0, \old(__tmp_129_0)=0, \old(__tmp_129_1)=0, \old(__tmp_129_2)=0, __return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=5, main__E1=5, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 2 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 27 SDslu, 96 SDs, 0 SdLazy, 10 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:08:13,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:08:13,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:08:13,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:08:13,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:08:13,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:08:13,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:08:13,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:08:13,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:08:13,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:08:13,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:08:13,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:08:13,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:08:13,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:08:13,871 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:08:13,872 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:08:13,872 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:08:13,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:08:13,875 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:08:13,876 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:08:13,876 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:08:13,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:08:13,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:08:13,879 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:08:13,879 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:08:13,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:08:13,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:08:13,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:08:13,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:08:13,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:08:13,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:08:13,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:08:13,883 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:08:13,883 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:08:13,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:08:13,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:08:13,884 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 10:08:13,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:08:13,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:08:13,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:08:13,895 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 10:08:13,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:08:13,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:08:13,896 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:08:13,896 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:08:13,896 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:08:13,896 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:08:13,896 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:08:13,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:08:13,898 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:08:13,898 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:08:13,898 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:08:13,898 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:08:13,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:08:13,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:08:13,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:08:13,899 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:08:13,899 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 10:08:13,899 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:08:13,899 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:08:13,899 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:08:13,899 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_dd12058c-a11d-4ef8-a517-6dac39db6b38/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 -> 056bf8e6ba5df6966e0f82320ce36676b5ee3b5e [2018-11-10 10:08:13,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:08:13,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:08:13,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:08:13,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:08:13,941 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:08:13,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:13,984 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/223493a4d/5aae40746edf43eeabb340f98cf0733b/FLAGa6dba5c7d [2018-11-10 10:08:14,293 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:08:14,294 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/sv-benchmarks/c/float-benchs/filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:14,298 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/223493a4d/5aae40746edf43eeabb340f98cf0733b/FLAGa6dba5c7d [2018-11-10 10:08:14,309 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/data/223493a4d/5aae40746edf43eeabb340f98cf0733b [2018-11-10 10:08:14,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:08:14,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 10:08:14,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:14,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:08:14,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:08:14,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583fadd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14, skipping insertion in model container [2018-11-10 10:08:14,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:08:14,344 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:08:14,457 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:14,462 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:08:14,486 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:08:14,497 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:08:14,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14 WrapperNode [2018-11-10 10:08:14,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:08:14,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:08:14,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:08:14,499 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:08:14,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... [2018-11-10 10:08:14,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:08:14,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:08:14,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:08:14,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:08:14,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:08:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:08:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:08:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:08:16,892 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:08:16,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:16 BoogieIcfgContainer [2018-11-10 10:08:16,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:08:16,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:08:16,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:08:16,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:08:16,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:08:14" (1/3) ... [2018-11-10 10:08:16,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419bae72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:16, skipping insertion in model container [2018-11-10 10:08:16,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:14" (2/3) ... [2018-11-10 10:08:16,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419bae72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:16, skipping insertion in model container [2018-11-10 10:08:16,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:08:16" (3/3) ... [2018-11-10 10:08:16,898 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1_true-unreach-call.c.v+lhb-reducer.c [2018-11-10 10:08:16,904 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:08:16,908 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-10 10:08:16,919 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-10 10:08:16,941 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:08:16,941 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:08:16,941 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:08:16,941 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:08:16,941 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:08:16,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:08:16,942 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:08:16,942 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:08:16,942 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:08:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-10 10:08:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:08:16,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:16,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:16,959 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:16,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2113161621, now seen corresponding path program 1 times [2018-11-10 10:08:16,965 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:16,965 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:16,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:17,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:17,040 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:17,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:17,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:08:17,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:08:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:08:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:08:17,061 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-11-10 10:08:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:17,109 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2018-11-10 10:08:17,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:08:17,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-10 10:08:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:17,117 INFO L225 Difference]: With dead ends: 64 [2018-11-10 10:08:17,117 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 10:08:17,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-10 10:08:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 10:08:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-11-10 10:08:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 10:08:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-10 10:08:17,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2018-11-10 10:08:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:17,146 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-10 10:08:17,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:08:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-10 10:08:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:08:17,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:17,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:17,147 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:17,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2118082726, now seen corresponding path program 1 times [2018-11-10 10:08:17,148 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:17,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:17,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:17,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:17,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:17,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:08:17,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:08:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:08:17,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:08:17,208 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 3 states. [2018-11-10 10:08:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:19,416 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-11-10 10:08:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:08:19,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-10 10:08:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:19,418 INFO L225 Difference]: With dead ends: 75 [2018-11-10 10:08:19,418 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 10:08:19,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:08:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 10:08:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-10 10:08:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 10:08:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-10 10:08:19,424 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 17 [2018-11-10 10:08:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:19,424 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-10 10:08:19,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:08:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-10 10:08:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 10:08:19,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:19,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:19,426 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:19,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:19,426 INFO L82 PathProgramCache]: Analyzing trace with hash -867319772, now seen corresponding path program 1 times [2018-11-10 10:08:19,426 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:19,426 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:19,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:19,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:19,883 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:19,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:19,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:08:19,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:08:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:08:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:08:19,899 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 6 states. [2018-11-10 10:08:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:22,735 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-11-10 10:08:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:08:22,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-10 10:08:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:22,736 INFO L225 Difference]: With dead ends: 71 [2018-11-10 10:08:22,736 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 10:08:22,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:08:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 10:08:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-10 10:08:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 10:08:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-10 10:08:22,741 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2018-11-10 10:08:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:22,741 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-10 10:08:22,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:08:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-10 10:08:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:08:22,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:22,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:22,742 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:22,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1391760154, now seen corresponding path program 1 times [2018-11-10 10:08:22,743 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:22,743 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:22,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:22,781 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:22,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:22,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:08:22,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:08:22,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:08:22,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:08:22,790 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-11-10 10:08:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:22,809 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-11-10 10:08:22,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:08:22,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 10:08:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:22,810 INFO L225 Difference]: With dead ends: 53 [2018-11-10 10:08:22,811 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 10:08:22,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-10 10:08:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 10:08:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 10:08:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 10:08:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-10 10:08:22,815 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2018-11-10 10:08:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:22,816 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-10 10:08:22,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:08:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-10 10:08:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:08:22,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:22,817 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:22,817 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:22,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:22,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1502730495, now seen corresponding path program 1 times [2018-11-10 10:08:22,818 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:22,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:22,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:22,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:22,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:22,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:08:22,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:08:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:08:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:08:22,883 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-10 10:08:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:22,930 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-10 10:08:22,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 10:08:22,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-10 10:08:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:22,930 INFO L225 Difference]: With dead ends: 52 [2018-11-10 10:08:22,931 INFO L226 Difference]: Without dead ends: 50 [2018-11-10 10:08:22,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10 10:08:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-10 10:08:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-10 10:08:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 10:08:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 10:08:22,934 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2018-11-10 10:08:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:22,935 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 10:08:22,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:08:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-10 10:08:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:08:22,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:22,935 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:22,935 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:22,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1344039708, now seen corresponding path program 1 times [2018-11-10 10:08:22,936 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:23,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:25,655 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:08:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:08:27,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:08:27,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:08:27,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:08:27,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:08:27,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:08:27,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=34, Unknown=1, NotChecked=12, Total=72 [2018-11-10 10:08:27,669 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 9 states. [2018-11-10 10:08:39,162 WARN L179 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 10:08:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:08:39,798 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2018-11-10 10:08:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:08:39,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-10 10:08:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:08:39,799 INFO L225 Difference]: With dead ends: 70 [2018-11-10 10:08:39,799 INFO L226 Difference]: Without dead ends: 51 [2018-11-10 10:08:39,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=4, NotChecked=14, Total=90 [2018-11-10 10:08:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-10 10:08:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-10 10:08:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 10:08:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-10 10:08:39,806 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 28 [2018-11-10 10:08:39,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:08:39,806 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-10 10:08:39,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:08:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-10 10:08:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:08:39,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:08:39,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:08:39,807 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:08:39,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:08:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash 575129618, now seen corresponding path program 1 times [2018-11-10 10:08:39,808 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:08:39,808 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:08:39,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:08:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:08:41,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:08:43,530 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (let ((.cse1 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse1 (let ((.cse2 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) main_~main__E1~0) .cse2)))) main_~main__E0~0) main_~main__E1~0)) (fp.leq main_~main__E0~0 .cse3) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from false [2018-11-10 10:08:45,555 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (let ((.cse1 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse1 (let ((.cse2 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) main_~main__E1~0) .cse2)))) main_~main__E0~0) main_~main__E1~0)) (fp.leq main_~main__E0~0 .cse3) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from true [2018-11-10 10:08:51,644 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq main_~main__E1~0 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E1~0) .cse3)))) main_~main__E0~0) main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~main__E1~0 .cse1))))) is different from false [2018-11-10 10:08:53,668 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq main_~main__E1~0 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse2 (let ((.cse3 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E1~0) .cse3)))) main_~main__E0~0) main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:09:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:05,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:09:05,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:09:05,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:09:05,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:09:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:09:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=45, Unknown=4, NotChecked=30, Total=110 [2018-11-10 10:09:05,878 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states. [2018-11-10 10:09:06,632 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-10 10:09:15,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:09:15,825 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-10 10:09:15,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:09:15,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-10 10:09:15,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:09:15,826 INFO L225 Difference]: With dead ends: 63 [2018-11-10 10:09:15,826 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 10:09:15,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=37, Invalid=57, Unknown=4, NotChecked=34, Total=132 [2018-11-10 10:09:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 10:09:15,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-10 10:09:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 10:09:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-11-10 10:09:15,834 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 28 [2018-11-10 10:09:15,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:09:15,834 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-11-10 10:09:15,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:09:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-11-10 10:09:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:09:15,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:09:15,835 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:09:15,835 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:09:15,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:09:15,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1772689557, now seen corresponding path program 1 times [2018-11-10 10:09:15,836 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:09:15,836 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:09:15,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:09:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:09:16,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:09:18,588 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:09:27,533 WARN L179 SmtUtils]: Spent 4.36 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 10:09:33,561 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E0~0) main_~main__E1~0)) (.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq main_~main__E0~0 .cse3) (not (fp.leq .cse1 .cse2)) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from false [2018-11-10 10:09:35,569 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E0~0) main_~main__E1~0)) (.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq main_~main__E0~0 .cse3) (not (fp.leq .cse1 .cse2)) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from true [2018-11-10 10:09:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:09:47,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:09:47,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:09:47,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 10:09:47,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 10:09:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 10:09:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=44, Unknown=4, NotChecked=30, Total=110 [2018-11-10 10:09:47,640 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 11 states. [2018-11-10 10:10:01,529 WARN L179 SmtUtils]: Spent 9.18 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-10 10:10:18,750 WARN L179 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 10:10:33,216 WARN L179 SmtUtils]: Spent 4.29 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 10:10:46,607 WARN L179 SmtUtils]: Spent 4.47 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 10:10:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:10:49,237 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-11-10 10:10:49,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:10:49,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-10 10:10:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:10:49,281 INFO L225 Difference]: With dead ends: 98 [2018-11-10 10:10:49,281 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 10:10:49,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=56, Invalid=96, Unknown=12, NotChecked=46, Total=210 [2018-11-10 10:10:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 10:10:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-10 10:10:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 10:10:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-11-10 10:10:49,295 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 29 [2018-11-10 10:10:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:10:49,295 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-11-10 10:10:49,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 10:10:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-11-10 10:10:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 10:10:49,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:10:49,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:10:49,296 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:10:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:10:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 160901429, now seen corresponding path program 1 times [2018-11-10 10:10:49,296 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:10:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:10:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:10:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:10:50,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:10:52,632 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (let ((.cse1 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse1 (let ((.cse2 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) main_~main__E1~0) .cse2)))) main_~main__E0~0) main_~main__E1~0)) (fp.leq main_~main__E0~0 .cse3) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from false [2018-11-10 10:10:54,668 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3))) (and (fp.geq main_~main__E0~0 .cse0) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (let ((.cse1 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse1 (let ((.cse2 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse1 .cse2) main_~main__E1~0) .cse2)))) main_~main__E0~0) main_~main__E1~0)) (fp.leq main_~main__E0~0 .cse3) (fp.geq main_~main__E1~0 .cse0) (fp.leq main_~main__E1~0 .cse3))))) is different from true [2018-11-10 10:11:29,767 WARN L179 SmtUtils]: Spent 9.75 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:11:35,876 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) main_~main__E1~0) .cse5)))) main_~main__E0~0) main_~main__E1~0)) (.cse3 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq main_~main__E1~0 .cse0) (not (fp.leq .cse2 .cse3)) (fp.leq main_~main__E1~0 .cse1))))) is different from false [2018-11-10 10:11:37,909 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 (fp.sub RNE (fp.add RNE (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse4 (let ((.cse5 ((_ to_fp 11 53) RNE (_ bv0 32)))) (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) main_~main__E1~0) .cse5)))) main_~main__E0~0) main_~main__E1~0)) (.cse3 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq main_~main__E1~0 .cse0) (not (fp.leq .cse2 .cse3)) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:11:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:11:50,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:11:50,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:11:50,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 10:11:50,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 10:11:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 10:11:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=50, Unknown=15, NotChecked=34, Total=132 [2018-11-10 10:11:50,142 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 12 states. [2018-11-10 10:12:12,753 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-10 10:12:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:12:47,822 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-10 10:12:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:12:47,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-10 10:12:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:12:47,825 INFO L225 Difference]: With dead ends: 66 [2018-11-10 10:12:47,825 INFO L226 Difference]: Without dead ends: 64 [2018-11-10 10:12:47,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=39, Invalid=63, Unknown=16, NotChecked=38, Total=156 [2018-11-10 10:12:47,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-10 10:12:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-10 10:12:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 10:12:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2018-11-10 10:12:47,838 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 29 [2018-11-10 10:12:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:12:47,838 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2018-11-10 10:12:47,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 10:12:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-10 10:12:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:12:47,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:12:47,839 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:12:47,839 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:12:47,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:12:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -748473924, now seen corresponding path program 1 times [2018-11-10 10:12:47,840 INFO L225 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-10 10:12:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/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-10 10:12:47,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:12:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:12:49,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:12:55,022 WARN L179 SmtUtils]: Spent 3.07 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 10:12:59,813 WARN L179 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 10:13:07,274 WARN L179 SmtUtils]: Spent 4.45 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 10:13:24,227 WARN L179 SmtUtils]: Spent 6.62 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 10:13:32,973 WARN L179 SmtUtils]: Spent 7.44 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 10:13:43,710 WARN L179 SmtUtils]: Spent 7.53 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-10 10:13:45,773 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E1~0) v_subst_1)) (.cse4 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq v_subst_1 .cse0) (fp.leq v_subst_1 .cse1) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E1~0 .cse0) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq .cse3 .cse4) (fp.leq main_~main__E1~0 .cse1))))) is different from false [2018-11-10 10:13:47,824 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E1~0) v_subst_1)) (.cse4 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq v_subst_1 .cse0) (fp.leq v_subst_1 .cse1) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E1~0 .cse0) (fp.geq .cse3 (fp.neg .cse4)) (fp.leq .cse3 .cse4) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:13:53,993 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse4 (fp.neg .cse5)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E1~0) v_subst_1))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq v_subst_1 .cse0) (fp.leq v_subst_1 .cse1) (fp.geq main_~main__E1~0 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E0~0) main_~main__E1~0) .cse4)) (fp.geq .cse3 .cse4) (fp.leq .cse3 .cse5) (fp.leq main_~main__E1~0 .cse1))))) is different from false [2018-11-10 10:13:56,045 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse4 (fp.neg .cse5)) (.cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E1~0) v_subst_1))) (and (fp.geq main_~main__E0~0 .cse0) (fp.leq main_~main__E0~0 .cse1) (fp.geq v_subst_1 .cse0) (fp.leq v_subst_1 .cse1) (fp.geq main_~main__E1~0 .cse0) (not (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse2 .cse3) main_~main__E0~0) main_~main__E1~0) .cse4)) (fp.geq .cse3 .cse4) (fp.leq .cse3 .cse5) (fp.leq main_~main__E1~0 .cse1))))) is different from true [2018-11-10 10:14:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-10 10:14:08,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:14:14,472 WARN L832 $PredicateComparison]: unable to prove that (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) is different from false [2018-11-10 10:14:59,018 WARN L179 SmtUtils]: Spent 10.14 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-10 10:15:01,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq main_~main__E0~0 (fp.neg .cse0))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) main_~main__E0~0) c_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq main_~main__E0~0 .cse0))))) is different from true [2018-11-10 10:15:03,117 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq main_~main__E0~0 (fp.neg .cse0))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) main_~main__E0~0) c_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq main_~main__E0~0 .cse0))))) (not (fp.leq c_main_~main__S~0 ((_ to_fp 11 53) RNE 10000.0)))) is different from true [2018-11-10 10:15:05,162 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (forall ((main_~main__E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq main_~main__E0~0 (fp.neg .cse0))) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) main_~main__E0~0) c_main_~main__E1~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0))) (not (fp.leq main_~main__E0~0 .cse0))))) (not (fp.leq c_main_~main__S~0 .cse1)) (not (fp.geq c_main_~main__S~0 (fp.neg .cse1))))) is different from true [2018-11-10 10:15:07,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (forall ((v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_subst_2 (fp.neg .cse0))) (not (fp.leq v_subst_2 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) v_subst_2) c_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))))) (not (fp.leq c_main_~main__S~0 .cse1)) (not (fp.geq c_main_~main__S~0 (fp.neg .cse1))))) is different from true [2018-11-10 10:15:09,251 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (forall ((v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_subst_2 (fp.neg .cse2))) (not (fp.leq v_subst_2 .cse2)) (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0))) v_subst_2) c_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))))) (not (fp.leq .cse0 .cse1)))) is different from false [2018-11-10 10:15:11,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (forall ((v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_subst_2 (fp.neg .cse2))) (not (fp.leq v_subst_2 .cse2)) (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0))) v_subst_2) c_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))))) (not (fp.leq .cse0 .cse1)))) is different from true [2018-11-10 10:15:13,361 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (forall ((v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_subst_2 (fp.neg .cse2))) (not (fp.leq v_subst_2 .cse2)) (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0))) v_subst_2) c_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))))) (not (fp.leq .cse0 .cse1)) (not (fp.leq c_main_~main__E0~0 ((_ to_fp 11 53) RNE 1.0))))) is different from false [2018-11-10 10:15:15,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0)) (.cse1 ((_ to_fp 11 53) RNE 10000.0))) (or (not (fp.geq .cse0 (fp.neg .cse1))) (forall ((v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (or (not (fp.geq v_subst_2 (fp.neg .cse2))) (not (fp.leq v_subst_2 .cse2)) (fp.geq (fp.sub RNE (fp.add RNE (let ((.cse3 ((_ to_fp 11 53) RNE (/ 999.0 1000.0)))) (fp.mul RNE .cse3 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse3 c_main_~main__S~0) c_main_~main__E0~0) c_main_~main__E1~0))) v_subst_2) c_main_~main__E0~0) (fp.neg ((_ to_fp 11 53) RNE 10000.0)))))) (not (fp.leq .cse0 .cse1)) (not (fp.leq c_main_~main__E0~0 ((_ to_fp 11 53) RNE 1.0))))) is different from true [2018-11-10 10:15:17,470 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~main__E0~0 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse5)) (.cse2 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 c_main_~main__S~0) main_~main__E0~0) c_main_~main__E1~0))) (or (not (fp.geq main_~main__E0~0 .cse0)) (not (fp.geq v_subst_2 .cse0)) (not (fp.leq v_subst_2 .cse1)) (not (fp.geq .cse2 .cse3)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse2) v_subst_2) main_~main__E0~0) .cse3) (not (fp.leq .cse2 .cse5)) (not (fp.leq main_~main__E0~0 .cse1)))))) is different from false [2018-11-10 10:15:19,546 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~main__E0~0 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse5)) (.cse2 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 c_main_~main__S~0) main_~main__E0~0) c_main_~main__E1~0))) (or (not (fp.geq main_~main__E0~0 .cse0)) (not (fp.geq v_subst_2 .cse0)) (not (fp.leq v_subst_2 .cse1)) (not (fp.geq .cse2 .cse3)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse2) v_subst_2) main_~main__E0~0) .cse3) (not (fp.leq .cse2 .cse5)) (not (fp.leq main_~main__E0~0 .cse1)))))) is different from true [2018-11-10 10:15:21,591 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 c_main_~main__S~0) v_subst_3) c_main_~main__E0~0))) (or (not (fp.geq .cse0 .cse1)) (not (fp.geq v_subst_2 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse2)) (not (fp.leq v_subst_2 .cse3)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse0) v_subst_2) v_subst_3) .cse1) (not (fp.leq .cse0 .cse5)))))) is different from false [2018-11-10 10:15:23,663 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse5 ((_ to_fp 11 53) RNE 10000.0)) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse1 (fp.neg .cse5)) (.cse0 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 c_main_~main__S~0) v_subst_3) c_main_~main__E0~0))) (or (not (fp.geq .cse0 .cse1)) (not (fp.geq v_subst_2 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse2)) (not (fp.leq v_subst_2 .cse3)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse0) v_subst_2) v_subst_3) .cse1) (not (fp.leq .cse0 .cse5)))))) is different from true [2018-11-10 10:15:25,700 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) v_subst_3) c_main_~main__E0~0)) (.cse5 (fp.neg .cse2))) (or (not (fp.geq v_subst_2 .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse1) v_subst_2) v_subst_3) .cse5) (not (fp.leq v_subst_2 .cse3)) (not (fp.geq .cse1 .cse5)))))) is different from false [2018-11-10 10:15:27,780 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) v_subst_3) c_main_~main__E0~0)) (.cse5 (fp.neg .cse2))) (or (not (fp.geq v_subst_2 .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse1) v_subst_2) v_subst_3) .cse5) (not (fp.leq v_subst_2 .cse3)) (not (fp.geq .cse1 .cse5)))))) is different from true [2018-11-10 10:15:29,834 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) v_subst_3) c_main_~main__E0~0)) (.cse5 (fp.neg .cse2))) (or (not (fp.geq v_subst_2 .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse1) v_subst_2) v_subst_3) .cse5) (not (fp.leq v_subst_2 .cse3)) (not (fp.geq .cse1 .cse5)))))) (not (fp.leq c_main_~main__E0~0 ((_ to_fp 11 53) RNE 1.0)))) is different from true [2018-11-10 10:15:36,012 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~main__E0~0 (_ FloatingPoint 11 53)) (v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) v_subst_3) main_~main__E0~0)) (.cse5 (fp.neg .cse2))) (or (not (fp.geq main_~main__E0~0 .cse0)) (not (fp.geq v_subst_2 .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse1) v_subst_2) v_subst_3) .cse5) (not (fp.leq v_subst_2 .cse3)) (not (fp.geq .cse1 .cse5)) (not (fp.leq main_~main__E0~0 .cse3)))))) is different from false [2018-11-10 10:15:38,064 WARN L854 $PredicateComparison]: unable to prove that (forall ((main_~main__E0~0 (_ FloatingPoint 11 53)) (v_subst_3 (_ FloatingPoint 11 53)) (v_subst_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) RNE 10000.0)) (.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) v_subst_3) main_~main__E0~0)) (.cse5 (fp.neg .cse2))) (or (not (fp.geq main_~main__E0~0 .cse0)) (not (fp.geq v_subst_2 .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_subst_3 .cse3)) (not (fp.geq v_subst_3 .cse0)) (fp.geq (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse1) v_subst_2) v_subst_3) .cse5) (not (fp.leq v_subst_2 .cse3)) (not (fp.geq .cse1 .cse5)) (not (fp.leq main_~main__E0~0 .cse3)))))) is different from true [2018-11-10 10:15:54,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:15:54,523 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dd12058c-a11d-4ef8-a517-6dac39db6b38/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:15:54,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:16:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-10 10:16:06,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:16:06,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-10 10:16:06,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 10:16:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 10:16:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=157, Unknown=38, NotChecked=574, Total=870 [2018-11-10 10:16:06,835 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 16 states. [2018-11-10 10:16:09,416 WARN L179 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-10 10:17:10,412 WARN L179 SmtUtils]: Spent 17.40 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-10 10:17:26,667 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (fp.geq c_main_~main__E0~0 (fp.neg .cse0)) (fp.leq c_main_~main__E0~0 .cse0) (exists ((main_~main__E1~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE ((_ to_fp 11 53) RNE (/ 999.0 1000.0)) ((_ to_fp 11 53) RNE (_ bv0 32))) c_main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E1~0 (fp.neg .cse1)) (fp.leq main_~main__E1~0 .cse1)))) (exists ((main_~main__E0~0 (_ FloatingPoint 11 53)) (main_~main__E1~0 (_ FloatingPoint 11 53)) (v_subst_1 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) RNE (/ 999.0 1000.0))) (.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.neg .cse3)) (.cse5 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 ((_ to_fp 11 53) RNE (_ bv0 32))) main_~main__E1~0) v_subst_1)) (.cse6 ((_ to_fp 11 53) RNE 10000.0))) (and (fp.geq main_~main__E0~0 .cse2) (fp.leq main_~main__E0~0 .cse3) (fp.geq v_subst_1 .cse2) (fp.leq v_subst_1 .cse3) (= c_main_~main__S~0 (fp.sub RNE (fp.add RNE (fp.mul RNE .cse4 .cse5) main_~main__E0~0) main_~main__E1~0)) (fp.geq main_~main__E1~0 .cse2) (fp.geq .cse5 (fp.neg .cse6)) (fp.leq .cse5 .cse6) (fp.leq main_~main__E1~0 .cse3))))))) is different from false [2018-11-10 10:17:30,248 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:689) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-11-10 10:17:30,251 INFO L168 Benchmark]: Toolchain (without parser) took 555938.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 953.2 MB in the beginning and 1.0 GB in the end (delta: -62.9 MB). Peak memory consumption was 99.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:17:30,251 INFO L168 Benchmark]: CDTParser took 0.14 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-10 10:17:30,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.31 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:17:30,252 INFO L168 Benchmark]: Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:17:30,253 INFO L168 Benchmark]: RCFGBuilder took 2366.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:17:30,253 INFO L168 Benchmark]: TraceAbstraction took 553357.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 120.7 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:17:30,256 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.14 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 184.31 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.41 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2366.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 553357.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 120.7 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...