./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54a68f41 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a552001c735a44e7c5826cbc850fdca20f73d60 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a552001c735a44e7c5826cbc850fdca20f73d60 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-54a68f4 [2020-12-03 17:58:33,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 17:58:33,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 17:58:33,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 17:58:33,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 17:58:33,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 17:58:33,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 17:58:33,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 17:58:33,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 17:58:33,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 17:58:33,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 17:58:33,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 17:58:33,154 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 17:58:33,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 17:58:33,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 17:58:33,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 17:58:33,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 17:58:33,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 17:58:33,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 17:58:33,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 17:58:33,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 17:58:33,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 17:58:33,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 17:58:33,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 17:58:33,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 17:58:33,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 17:58:33,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 17:58:33,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 17:58:33,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 17:58:33,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 17:58:33,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 17:58:33,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 17:58:33,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 17:58:33,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 17:58:33,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 17:58:33,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 17:58:33,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 17:58:33,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 17:58:33,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 17:58:33,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 17:58:33,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 17:58:33,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 17:58:33,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 17:58:33,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 17:58:33,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 17:58:33,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 17:58:33,269 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 17:58:33,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 17:58:33,270 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 17:58:33,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 17:58:33,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 17:58:33,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 17:58:33,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 17:58:33,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 17:58:33,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 17:58:33,273 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 17:58:33,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 17:58:33,274 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 17:58:33,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 17:58:33,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 17:58:33,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 17:58:33,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 17:58:33,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 17:58:33,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 17:58:33,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 17:58:33,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 17:58:33,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 17:58:33,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 17:58:33,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 17:58:33,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 17:58:33,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 1a552001c735a44e7c5826cbc850fdca20f73d60 [2020-12-03 17:58:33,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 17:58:33,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 17:58:33,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 17:58:33,829 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 17:58:33,830 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 17:58:33,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:33,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937f0e53/213e181fdaea4549995dfaaa383d4435/FLAG50a6520ce [2020-12-03 17:58:34,563 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 17:58:34,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:34,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937f0e53/213e181fdaea4549995dfaaa383d4435/FLAG50a6520ce [2020-12-03 17:58:34,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937f0e53/213e181fdaea4549995dfaaa383d4435 [2020-12-03 17:58:34,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 17:58:34,940 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 17:58:34,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 17:58:34,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 17:58:34,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 17:58:34,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:34" (1/1) ... [2020-12-03 17:58:34,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7622d47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:34, skipping insertion in model container [2020-12-03 17:58:34,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:34" (1/1) ... [2020-12-03 17:58:34,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 17:58:34,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 17:58:35,186 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2020-12-03 17:58:35,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 17:58:35,204 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 17:58:35,221 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2020-12-03 17:58:35,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 17:58:35,238 INFO L208 MainTranslator]: Completed translation [2020-12-03 17:58:35,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35 WrapperNode [2020-12-03 17:58:35,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 17:58:35,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 17:58:35,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 17:58:35,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 17:58:35,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 17:58:35,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 17:58:35,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 17:58:35,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 17:58:35,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... [2020-12-03 17:58:35,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 17:58:35,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 17:58:35,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 17:58:35,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 17:58:35,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 17:58:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 17:58:35,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 17:58:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 17:58:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 17:58:35,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 17:58:35,697 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-03 17:58:35,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:35 BoogieIcfgContainer [2020-12-03 17:58:35,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 17:58:35,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 17:58:35,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 17:58:35,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 17:58:35,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:58:34" (1/3) ... [2020-12-03 17:58:35,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6090b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:35, skipping insertion in model container [2020-12-03 17:58:35,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:35" (2/3) ... [2020-12-03 17:58:35,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6090b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:35, skipping insertion in model container [2020-12-03 17:58:35,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:35" (3/3) ... [2020-12-03 17:58:35,720 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:35,740 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 17:58:35,744 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 17:58:35,760 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 17:58:35,811 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 17:58:35,814 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 17:58:35,814 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 17:58:35,815 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 17:58:35,815 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 17:58:35,815 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 17:58:35,815 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 17:58:35,815 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 17:58:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-03 17:58:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-03 17:58:35,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:35,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-03 17:58:35,850 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-03 17:58:35,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:35,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688397420] [2020-12-03 17:58:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:36,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688397420] [2020-12-03 17:58:36,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 17:58:36,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 17:58:36,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437177975] [2020-12-03 17:58:36,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 17:58:36,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 17:58:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 17:58:36,171 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-03 17:58:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:36,196 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-03 17:58:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 17:58:36,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-03 17:58:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:36,210 INFO L225 Difference]: With dead ends: 16 [2020-12-03 17:58:36,211 INFO L226 Difference]: Without dead ends: 7 [2020-12-03 17:58:36,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 17:58:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-12-03 17:58:36,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-12-03 17:58:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-12-03 17:58:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-12-03 17:58:36,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-12-03 17:58:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:36,254 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-12-03 17:58:36,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 17:58:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-12-03 17:58:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-03 17:58:36,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:36,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-03 17:58:36,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 17:58:36,256 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-12-03 17:58:36,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:36,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824602576] [2020-12-03 17:58:36,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:36,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824602576] [2020-12-03 17:58:36,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464833578] [2020-12-03 17:58:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:36,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 17:58:36,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:36,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:36,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-12-03 17:58:36,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770973315] [2020-12-03 17:58:36,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 17:58:36,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 17:58:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-03 17:58:36,521 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2020-12-03 17:58:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:36,538 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-12-03 17:58:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 17:58:36,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2020-12-03 17:58:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:36,539 INFO L225 Difference]: With dead ends: 11 [2020-12-03 17:58:36,540 INFO L226 Difference]: Without dead ends: 8 [2020-12-03 17:58:36,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-03 17:58:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-12-03 17:58:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-12-03 17:58:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-12-03 17:58:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-12-03 17:58:36,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-12-03 17:58:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:36,545 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-12-03 17:58:36,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 17:58:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-12-03 17:58:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-03 17:58:36,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:36,547 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-12-03 17:58:36,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-03 17:58:36,762 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-12-03 17:58:36,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:36,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187202685] [2020-12-03 17:58:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:36,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187202685] [2020-12-03 17:58:36,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579255495] [2020-12-03 17:58:36,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:36,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-03 17:58:36,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:36,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-03 17:58:36,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:36,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:36,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-03 17:58:36,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687616229] [2020-12-03 17:58:36,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 17:58:36,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 17:58:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-03 17:58:36,920 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2020-12-03 17:58:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:36,934 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-12-03 17:58:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 17:58:36,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-12-03 17:58:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:36,936 INFO L225 Difference]: With dead ends: 12 [2020-12-03 17:58:36,936 INFO L226 Difference]: Without dead ends: 9 [2020-12-03 17:58:36,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-12-03 17:58:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-03 17:58:36,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-03 17:58:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-03 17:58:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-12-03 17:58:36,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-12-03 17:58:36,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:36,941 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-12-03 17:58:36,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 17:58:36,942 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-12-03 17:58:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-03 17:58:36,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:36,943 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-12-03 17:58:37,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:37,157 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-12-03 17:58:37,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:37,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334459488] [2020-12-03 17:58:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:37,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334459488] [2020-12-03 17:58:37,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076582447] [2020-12-03 17:58:37,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:37,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-03 17:58:37,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-03 17:58:37,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:37,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:37,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-12-03 17:58:37,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836469951] [2020-12-03 17:58:37,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 17:58:37,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:37,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 17:58:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-03 17:58:37,383 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2020-12-03 17:58:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:37,400 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-12-03 17:58:37,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 17:58:37,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-12-03 17:58:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:37,401 INFO L225 Difference]: With dead ends: 13 [2020-12-03 17:58:37,401 INFO L226 Difference]: Without dead ends: 10 [2020-12-03 17:58:37,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-03 17:58:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-12-03 17:58:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-12-03 17:58:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-03 17:58:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-03 17:58:37,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-12-03 17:58:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:37,407 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-03 17:58:37,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 17:58:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-03 17:58:37,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 17:58:37,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:37,408 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-12-03 17:58:37,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:37,622 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-12-03 17:58:37,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:37,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939312411] [2020-12-03 17:58:37,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:37,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939312411] [2020-12-03 17:58:37,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784263716] [2020-12-03 17:58:37,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:37,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-03 17:58:37,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:37,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-03 17:58:37,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:37,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:37,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-12-03 17:58:37,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485107463] [2020-12-03 17:58:37,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 17:58:37,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 17:58:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-03 17:58:37,826 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2020-12-03 17:58:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:37,842 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-12-03 17:58:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 17:58:37,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-12-03 17:58:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:37,843 INFO L225 Difference]: With dead ends: 14 [2020-12-03 17:58:37,843 INFO L226 Difference]: Without dead ends: 11 [2020-12-03 17:58:37,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-03 17:58:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-03 17:58:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-12-03 17:58:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-12-03 17:58:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-12-03 17:58:37,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-12-03 17:58:37,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:37,847 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-12-03 17:58:37,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 17:58:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-12-03 17:58:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-03 17:58:37,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:37,848 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-12-03 17:58:38,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:38,064 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:38,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:38,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2020-12-03 17:58:38,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:38,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156130852] [2020-12-03 17:58:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:38,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156130852] [2020-12-03 17:58:38,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121031545] [2020-12-03 17:58:38,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:38,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-12-03 17:58:38,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:38,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-03 17:58:38,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:38,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:38,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-12-03 17:58:38,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542911829] [2020-12-03 17:58:38,274 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-03 17:58:38,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-03 17:58:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-03 17:58:38,276 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2020-12-03 17:58:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:38,299 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-12-03 17:58:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 17:58:38,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2020-12-03 17:58:38,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:38,301 INFO L225 Difference]: With dead ends: 15 [2020-12-03 17:58:38,301 INFO L226 Difference]: Without dead ends: 12 [2020-12-03 17:58:38,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-12-03 17:58:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-12-03 17:58:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-12-03 17:58:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-12-03 17:58:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-12-03 17:58:38,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-12-03 17:58:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:38,307 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-12-03 17:58:38,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-03 17:58:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-12-03 17:58:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 17:58:38,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:38,308 INFO L422 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2020-12-03 17:58:38,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-12-03 17:58:38,524 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:38,526 INFO L82 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 6 times [2020-12-03 17:58:38,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:38,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75806050] [2020-12-03 17:58:38,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:38,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75806050] [2020-12-03 17:58:38,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777834852] [2020-12-03 17:58:38,613 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:38,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-12-03 17:58:38,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:38,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-03 17:58:38,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:38,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:38,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:38,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-12-03 17:58:38,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223997479] [2020-12-03 17:58:38,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-03 17:58:38,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-03 17:58:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-03 17:58:38,722 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2020-12-03 17:58:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:38,741 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-12-03 17:58:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-03 17:58:38,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2020-12-03 17:58:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:38,742 INFO L225 Difference]: With dead ends: 16 [2020-12-03 17:58:38,742 INFO L226 Difference]: Without dead ends: 13 [2020-12-03 17:58:38,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-12-03 17:58:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-12-03 17:58:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-12-03 17:58:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-12-03 17:58:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-12-03 17:58:38,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-12-03 17:58:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:38,746 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-12-03 17:58:38,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-03 17:58:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-12-03 17:58:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 17:58:38,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:38,747 INFO L422 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2020-12-03 17:58:38,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:38,961 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash 48273382, now seen corresponding path program 7 times [2020-12-03 17:58:38,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:38,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486626747] [2020-12-03 17:58:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:39,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486626747] [2020-12-03 17:58:39,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942332059] [2020-12-03 17:58:39,052 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:39,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-03 17:58:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:39,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:39,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2020-12-03 17:58:39,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794774160] [2020-12-03 17:58:39,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-03 17:58:39,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-03 17:58:39,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-03 17:58:39,152 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2020-12-03 17:58:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:39,174 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-12-03 17:58:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 17:58:39,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2020-12-03 17:58:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:39,175 INFO L225 Difference]: With dead ends: 17 [2020-12-03 17:58:39,176 INFO L226 Difference]: Without dead ends: 14 [2020-12-03 17:58:39,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-12-03 17:58:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-03 17:58:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-03 17:58:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-03 17:58:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-12-03 17:58:39,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-12-03 17:58:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:39,181 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-12-03 17:58:39,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-03 17:58:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-12-03 17:58:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 17:58:39,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:39,182 INFO L422 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2020-12-03 17:58:39,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:39,396 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1496412358, now seen corresponding path program 8 times [2020-12-03 17:58:39,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:39,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307790488] [2020-12-03 17:58:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:39,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307790488] [2020-12-03 17:58:39,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350012460] [2020-12-03 17:58:39,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:39,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-03 17:58:39,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:39,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 17:58:39,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:39,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:39,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-12-03 17:58:39,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74162733] [2020-12-03 17:58:39,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 17:58:39,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:39,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 17:58:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-12-03 17:58:39,660 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2020-12-03 17:58:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:39,689 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-12-03 17:58:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-03 17:58:39,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2020-12-03 17:58:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:39,691 INFO L225 Difference]: With dead ends: 18 [2020-12-03 17:58:39,691 INFO L226 Difference]: Without dead ends: 15 [2020-12-03 17:58:39,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-12-03 17:58:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-12-03 17:58:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-12-03 17:58:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-12-03 17:58:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-12-03 17:58:39,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-12-03 17:58:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:39,696 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-12-03 17:58:39,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 17:58:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-12-03 17:58:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-03 17:58:39,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:39,698 INFO L422 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2020-12-03 17:58:39,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-12-03 17:58:39,914 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:39,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:39,915 INFO L82 PathProgramCache]: Analyzing trace with hash -855919642, now seen corresponding path program 9 times [2020-12-03 17:58:39,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:39,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968809512] [2020-12-03 17:58:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:40,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968809512] [2020-12-03 17:58:40,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367523936] [2020-12-03 17:58:40,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:40,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-03 17:58:40,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-03 17:58:40,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-03 17:58:40,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:40,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:40,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2020-12-03 17:58:40,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643331931] [2020-12-03 17:58:40,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-03 17:58:40,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 17:58:40,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-03 17:58:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-12-03 17:58:40,160 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2020-12-03 17:58:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:40,188 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-12-03 17:58:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 17:58:40,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-12-03 17:58:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:40,190 INFO L225 Difference]: With dead ends: 19 [2020-12-03 17:58:40,190 INFO L226 Difference]: Without dead ends: 16 [2020-12-03 17:58:40,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2020-12-03 17:58:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-03 17:58:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-03 17:58:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-03 17:58:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-12-03 17:58:40,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2020-12-03 17:58:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:40,196 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-12-03 17:58:40,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-03 17:58:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-12-03 17:58:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 17:58:40,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:40,198 INFO L422 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2020-12-03 17:58:40,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 17:58:40,403 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 10 times [2020-12-03 17:58:40,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 17:58:40,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024752126] [2020-12-03 17:58:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 17:58:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 17:58:40,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 17:58:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 17:58:40,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 17:58:40,497 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 17:58:40,500 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 17:58:40,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-03 17:58:40,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:58:40 BoogieIcfgContainer [2020-12-03 17:58:40,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 17:58:40,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 17:58:40,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 17:58:40,569 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 17:58:40,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:35" (3/4) ... [2020-12-03 17:58:40,574 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 17:58:40,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 17:58:40,576 INFO L168 Benchmark]: Toolchain (without parser) took 5635.11 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 30.5 MB in the beginning and 29.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 16.1 GB. [2020-12-03 17:58:40,577 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 37.7 MB. Free memory is still 20.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 17:58:40,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.67 ms. Allocated memory is still 52.4 MB. Free memory was 30.4 MB in the beginning and 34.2 MB in the end (delta: -3.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-03 17:58:40,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.71 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 32.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 17:58:40,579 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 ms. Allocated memory is still 52.4 MB. Free memory was 32.9 MB in the beginning and 32.0 MB in the end (delta: 896.6 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-03 17:58:40,580 INFO L168 Benchmark]: RCFGBuilder took 397.63 ms. Allocated memory is still 52.4 MB. Free memory was 31.9 MB in the beginning and 34.7 MB in the end (delta: -2.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-12-03 17:58:40,581 INFO L168 Benchmark]: TraceAbstraction took 4864.08 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 34.3 MB in the beginning and 29.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2020-12-03 17:58:40,582 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 62.9 MB. Free memory is still 29.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 17:58:40,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 37.7 MB. Free memory is still 20.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 296.67 ms. Allocated memory is still 52.4 MB. Free memory was 30.4 MB in the beginning and 34.2 MB in the end (delta: -3.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.71 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 32.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.44 ms. Allocated memory is still 52.4 MB. Free memory was 32.9 MB in the beginning and 32.0 MB in the end (delta: 896.6 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 397.63 ms. Allocated memory is still 52.4 MB. Free memory was 31.9 MB in the beginning and 34.7 MB in the end (delta: -2.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4864.08 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 34.3 MB in the beginning and 29.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.19 ms. Allocated memory is still 62.9 MB. Free memory is still 29.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 29]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L29] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.6s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 SDtfs, 0 SDslu, 156 SDs, 0 SdLazy, 118 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 200 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 3786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/330 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-54a68f4 [2020-12-03 17:58:43,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 17:58:43,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 17:58:43,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 17:58:43,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 17:58:43,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 17:58:43,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 17:58:43,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 17:58:43,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 17:58:43,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 17:58:43,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 17:58:43,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 17:58:43,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 17:58:43,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 17:58:43,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 17:58:43,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 17:58:43,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 17:58:43,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 17:58:43,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 17:58:43,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 17:58:43,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 17:58:43,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 17:58:43,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 17:58:43,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 17:58:43,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 17:58:43,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 17:58:43,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 17:58:43,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 17:58:43,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 17:58:43,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 17:58:43,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 17:58:43,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 17:58:43,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 17:58:43,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 17:58:43,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 17:58:43,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 17:58:43,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 17:58:43,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 17:58:43,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 17:58:43,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 17:58:43,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 17:58:43,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-03 17:58:43,595 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 17:58:43,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 17:58:43,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 17:58:43,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 17:58:43,600 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 17:58:43,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 17:58:43,600 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 17:58:43,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 17:58:43,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 17:58:43,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 17:58:43,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 17:58:43,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 17:58:43,602 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-03 17:58:43,602 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-03 17:58:43,603 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 17:58:43,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 17:58:43,603 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 17:58:43,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 17:58:43,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 17:58:43,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 17:58:43,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 17:58:43,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 17:58:43,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 17:58:43,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 17:58:43,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 17:58:43,605 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-03 17:58:43,605 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-03 17:58:43,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 17:58:43,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 17:58:43,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 17:58:43,606 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 1a552001c735a44e7c5826cbc850fdca20f73d60 [2020-12-03 17:58:44,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 17:58:44,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 17:58:44,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 17:58:44,113 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 17:58:44,118 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 17:58:44,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:44,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ac5afcd/db40ae245f8649d880bec42d1c407319/FLAGd29157b85 [2020-12-03 17:58:44,953 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 17:58:44,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:44,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ac5afcd/db40ae245f8649d880bec42d1c407319/FLAGd29157b85 [2020-12-03 17:58:45,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ac5afcd/db40ae245f8649d880bec42d1c407319 [2020-12-03 17:58:45,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 17:58:45,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 17:58:45,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 17:58:45,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 17:58:45,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 17:58:45,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72720bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45, skipping insertion in model container [2020-12-03 17:58:45,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 17:58:45,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 17:58:45,562 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2020-12-03 17:58:45,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 17:58:45,585 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 17:58:45,602 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/drift_tenth.c.p+cfa-reducer.c[721,734] [2020-12-03 17:58:45,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 17:58:45,622 INFO L208 MainTranslator]: Completed translation [2020-12-03 17:58:45,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45 WrapperNode [2020-12-03 17:58:45,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 17:58:45,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 17:58:45,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 17:58:45,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 17:58:45,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 17:58:45,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 17:58:45,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 17:58:45,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 17:58:45,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... [2020-12-03 17:58:45,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 17:58:45,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 17:58:45,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 17:58:45,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 17:58:45,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 17:58:45,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 17:58:45,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 17:58:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-03 17:58:45,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 17:58:46,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 17:58:46,291 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-03 17:58:46,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:46 BoogieIcfgContainer [2020-12-03 17:58:46,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 17:58:46,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 17:58:46,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 17:58:46,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 17:58:46,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:58:45" (1/3) ... [2020-12-03 17:58:46,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff2766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:46, skipping insertion in model container [2020-12-03 17:58:46,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:58:45" (2/3) ... [2020-12-03 17:58:46,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff2766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:58:46, skipping insertion in model container [2020-12-03 17:58:46,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:46" (3/3) ... [2020-12-03 17:58:46,322 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2020-12-03 17:58:46,356 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 17:58:46,367 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 17:58:46,393 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 17:58:46,445 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 17:58:46,445 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 17:58:46,446 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 17:58:46,446 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 17:58:46,446 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 17:58:46,446 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 17:58:46,447 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 17:58:46,447 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 17:58:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-03 17:58:46,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-03 17:58:46,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:46,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-03 17:58:46,480 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-12-03 17:58:46,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 17:58:46,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917747857] [2020-12-03 17:58:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-03 17:58:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:46,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-03 17:58:46,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:46,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 17:58:46,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917747857] [2020-12-03 17:58:46,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 17:58:46,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-03 17:58:46,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115120338] [2020-12-03 17:58:46,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-03 17:58:46,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 17:58:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-03 17:58:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 17:58:46,813 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-03 17:58:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:47,039 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-12-03 17:58:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-03 17:58:47,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-03 17:58:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:47,058 INFO L225 Difference]: With dead ends: 16 [2020-12-03 17:58:47,058 INFO L226 Difference]: Without dead ends: 7 [2020-12-03 17:58:47,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-03 17:58:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-12-03 17:58:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-12-03 17:58:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-12-03 17:58:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-12-03 17:58:47,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-12-03 17:58:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:47,110 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-12-03 17:58:47,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-03 17:58:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-12-03 17:58:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-03 17:58:47,112 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:47,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-03 17:58:47,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-03 17:58:47,328 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-12-03 17:58:47,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 17:58:47,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59463287] [2020-12-03 17:58:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-03 17:58:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:47,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 17:58:47,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:47,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 17:58:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:47,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59463287] [2020-12-03 17:58:47,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:47,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-03 17:58:47,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136976761] [2020-12-03 17:58:47,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 17:58:47,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 17:58:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 17:58:47,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-03 17:58:47,549 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2020-12-03 17:58:48,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:48,176 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-12-03 17:58:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 17:58:48,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-12-03 17:58:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:48,181 INFO L225 Difference]: With dead ends: 13 [2020-12-03 17:58:48,181 INFO L226 Difference]: Without dead ends: 10 [2020-12-03 17:58:48,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-12-03 17:58:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-12-03 17:58:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-12-03 17:58:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-03 17:58:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-03 17:58:48,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2020-12-03 17:58:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:48,187 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-03 17:58:48,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 17:58:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-03 17:58:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-03 17:58:48,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:48,188 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-12-03 17:58:48,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-03 17:58:48,404 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2020-12-03 17:58:48,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 17:58:48,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369608436] [2020-12-03 17:58:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-03 17:58:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:48,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-03 17:58:48,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:48,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 17:58:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 17:58:48,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369608436] [2020-12-03 17:58:48,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 17:58:48,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-12-03 17:58:48,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607598797] [2020-12-03 17:58:48,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-03 17:58:48,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 17:58:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-03 17:58:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-12-03 17:58:48,855 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 12 states. [2020-12-03 17:58:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 17:58:49,838 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-12-03 17:58:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-03 17:58:49,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2020-12-03 17:58:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 17:58:49,844 INFO L225 Difference]: With dead ends: 19 [2020-12-03 17:58:49,844 INFO L226 Difference]: Without dead ends: 16 [2020-12-03 17:58:49,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2020-12-03 17:58:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-12-03 17:58:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-12-03 17:58:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-12-03 17:58:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-12-03 17:58:49,851 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-12-03 17:58:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 17:58:49,851 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-12-03 17:58:49,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-03 17:58:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-12-03 17:58:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 17:58:49,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 17:58:49,852 INFO L422 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2020-12-03 17:58:50,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-03 17:58:50,057 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 17:58:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 17:58:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2020-12-03 17:58:50,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 17:58:50,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889148569] [2020-12-03 17:58:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-03 17:58:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 17:58:50,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-03 17:58:50,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 17:58:50,673 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-03 17:58:51,200 WARN L197 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-03 17:58:53,439 WARN L197 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2020-12-03 17:58:57,739 WARN L197 SmtUtils]: Spent 3.89 s on a formula simplification that was a NOOP. DAG size: 18 [2020-12-03 17:59:12,555 WARN L197 SmtUtils]: Spent 7.46 s on a formula simplification that was a NOOP. DAG size: 19 [2020-12-03 17:59:21,878 WARN L197 SmtUtils]: Spent 9.18 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-03 17:59:30,316 WARN L197 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 21 [2020-12-03 17:59:40,625 WARN L197 SmtUtils]: Spent 10.14 s on a formula simplification that was a NOOP. DAG size: 22 [2020-12-03 17:59:42,715 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__time~0 (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 17:59:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-12-03 17:59:42,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 17:59:43,759 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-03 17:59:50,529 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 9 [2020-12-03 17:59:54,436 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 17:59:57,655 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 17:59:59,682 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:01,711 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:03,747 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:05,770 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:07,800 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:09,827 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:11,865 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:13,896 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:15,934 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:17,971 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:20,015 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:22,055 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:24,100 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:26,137 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:28,186 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2020-12-03 18:00:30,226 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-03 18:00:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2020-12-03 18:00:30,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889148569] [2020-12-03 18:00:30,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:00:30,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2020-12-03 18:00:30,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569322436] [2020-12-03 18:00:30,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-03 18:00:30,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:00:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-03 18:00:30,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=213, Unknown=19, NotChecked=440, Total=756 [2020-12-03 18:00:30,232 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 28 states. [2020-12-03 18:00:33,213 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:35,266 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__time~0 ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:37,312 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0))) is different from true [2020-12-03 18:00:39,355 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0))) is different from true [2020-12-03 18:00:41,404 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:43,441 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:45,486 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:47,516 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-12-03 18:00:49,542 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0))) is different from true [2020-12-03 18:00:51,564 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__tick~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__time~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0) c_ULTIMATE.start_main_~main__tick~0)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-12-03 18:00:54,592 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_main_~main__time~0 (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~main__time~0 c_ULTIMATE.start_main_~main__tick~0)) .cse1)))) is different from true [2020-12-03 18:01:02,453 WARN L197 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-03 18:01:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:01:02,927 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-12-03 18:01:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-03 18:01:02,928 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 15 [2020-12-03 18:01:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:01:02,928 INFO L225 Difference]: With dead ends: 22 [2020-12-03 18:01:02,929 INFO L226 Difference]: Without dead ends: 18 [2020-12-03 18:01:02,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 124.9s TimeCoverageRelationStatistics Valid=111, Invalid=253, Unknown=30, NotChecked=1166, Total=1560 [2020-12-03 18:01:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-03 18:01:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-12-03 18:01:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-03 18:01:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-12-03 18:01:02,937 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-12-03 18:01:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:01:02,938 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-12-03 18:01:02,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-03 18:01:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-12-03 18:01:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 18:01:02,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:01:02,939 INFO L422 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2020-12-03 18:01:03,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-03 18:01:03,140 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:01:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:01:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash 456734918, now seen corresponding path program 4 times [2020-12-03 18:01:03,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:01:03,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444128540] [2020-12-03 18:01:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-03 18:01:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:01:03,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-03 18:01:03,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:01:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-03 18:01:04,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-03 18:01:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-03 18:01:05,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444128540] [2020-12-03 18:01:05,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-03 18:01:05,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2020-12-03 18:01:05,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463783591] [2020-12-03 18:01:05,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-12-03 18:01:05,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:01:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-12-03 18:01:05,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-12-03 18:01:05,699 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 24 states. [2020-12-03 18:01:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:01:06,947 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-12-03 18:01:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 18:01:06,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 17 [2020-12-03 18:01:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:01:06,955 INFO L225 Difference]: With dead ends: 18 [2020-12-03 18:01:06,955 INFO L226 Difference]: Without dead ends: 0 [2020-12-03 18:01:06,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-12-03 18:01:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-03 18:01:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-03 18:01:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-03 18:01:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-03 18:01:06,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-12-03 18:01:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:01:06,957 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-03 18:01:06,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-12-03 18:01:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-03 18:01:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-03 18:01:07,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-03 18:01:07,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-03 18:09:36,107 WARN L197 SmtUtils]: Spent 8.48 m on a formula simplification. DAG size of input: 146 DAG size of output: 105 [2020-12-03 18:09:36,112 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-03 18:09:36,112 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-03 18:09:36,112 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-03 18:09:36,113 INFO L262 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-12-03 18:09:36,113 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-03 18:09:36,113 INFO L262 CegarLoopResult]: For program point L27(lines 27 35) no Hoare annotation was computed. [2020-12-03 18:09:36,113 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2020-12-03 18:09:36,114 INFO L258 CegarLoopResult]: At program point L18(lines 8 38) the Hoare annotation is: (let ((.cse11 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)))) (let ((.cse4 (fp.add currentRoundingMode .cse11 ULTIMATE.start_main_~main__tick~0))) (let ((.cse7 (fp.add currentRoundingMode .cse4 ULTIMATE.start_main_~main__tick~0))) (let ((.cse10 (fp.add currentRoundingMode .cse7 ULTIMATE.start_main_~main__tick~0))) (let ((.cse8 (fp.add currentRoundingMode .cse10 ULTIMATE.start_main_~main__tick~0))) (let ((.cse9 (fp.add currentRoundingMode .cse8 ULTIMATE.start_main_~main__tick~0))) (let ((.cse13 (fp.add currentRoundingMode ULTIMATE.start_main_~main__time~0 ULTIMATE.start_main_~main__tick~0)) (.cse14 (fp.add currentRoundingMode .cse9 ULTIMATE.start_main_~main__tick~0))) (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (.cse6 (fp.add currentRoundingMode .cse14 ULTIMATE.start_main_~main__tick~0)) (.cse5 (fp.add currentRoundingMode (fp.add currentRoundingMode .cse13 ULTIMATE.start_main_~main__tick~0) ULTIMATE.start_main_~main__tick~0))) (let ((.cse0 (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode .cse5 ULTIMATE.start_main_~main__tick~0) ULTIMATE.start_main_~main__tick~0) ULTIMATE.start_main_~main__tick~0) ULTIMATE.start_main_~main__tick~0) ULTIMATE.start_main_~main__tick~0)) (.cse1 ((_ to_fp 11 53) currentRoundingMode 1.0)) (.cse15 (fp.add currentRoundingMode .cse6 ULTIMATE.start_main_~main__tick~0)) (.cse2 (= ULTIMATE.start_main_~main__tick~0 .cse12)) (.cse3 (= currentRoundingMode roundNearestTiesToEven))) (or (and (not (fp.eq ((_ to_fp 11 53) currentRoundingMode (fp.add currentRoundingMode .cse0 ULTIMATE.start_main_~main__tick~0)) .cse1)) .cse2 .cse3 (= (_ bv1 32) ULTIMATE.start_main_~main__i~0) (= ULTIMATE.start_main_~main__time~0 .cse4)) (and (= (_ bv0 32) (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967289 32))) .cse2 .cse3 (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse5) .cse1)) (= ULTIMATE.start_main_~main__time~0 .cse6)) (and (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse2 .cse3 (= ULTIMATE.start_main_~main__time~0 .cse7) (= (_ bv0 32) (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967294 32)))) (and .cse2 (= ULTIMATE.start_main_~main__time~0 .cse8) .cse3 (= (_ bv4 32) ULTIMATE.start_main_~main__i~0)) (and .cse2 (= (_ bv0 32) (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967291 32))) (= ULTIMATE.start_main_~main__time~0 .cse9) .cse3) (and .cse2 (= (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967293 32)) (_ bv0 32)) .cse3 (= ULTIMATE.start_main_~main__time~0 .cse10)) (and (= ULTIMATE.start_main_~main__time~0 (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode .cse11 .cse12) .cse12) .cse12) .cse12) .cse12) .cse12) .cse12) .cse12) .cse12) .cse12)) (= (_ bv0 32) (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967286 32))) .cse3 (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse13) .cse1))) (and (= ULTIMATE.start_main_~main__time~0 .cse14) .cse2 .cse3 (= (_ bv6 32) ULTIMATE.start_main_~main__i~0)) (and (= (_ bv9 32) ULTIMATE.start_main_~main__i~0) .cse2 .cse3 (= ULTIMATE.start_main_~main__time~0 (fp.add currentRoundingMode .cse15 ULTIMATE.start_main_~main__tick~0))) (and (= (_ bv0 32) (bvadd ULTIMATE.start_main_~main__i~0 (_ bv4294967288 32))) .cse2 .cse3 (= ULTIMATE.start_main_~main__time~0 .cse15)) (and .cse2 .cse3 (= ULTIMATE.start_main_~main__time~0 .cse11) (= (_ bv0 32) ULTIMATE.start_main_~main__i~0)))))))))))) [2020-12-03 18:09:36,114 INFO L265 CegarLoopResult]: At program point L34(lines 7 38) the Hoare annotation is: true [2020-12-03 18:09:36,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:09:36 BoogieIcfgContainer [2020-12-03 18:09:36,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 18:09:36,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 18:09:36,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 18:09:36,174 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 18:09:36,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:58:46" (3/4) ... [2020-12-03 18:09:36,179 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-03 18:09:36,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-03 18:09:36,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-12-03 18:09:36,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-03 18:09:36,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-03 18:09:36,248 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-03 18:09:36,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 18:09:36,250 INFO L168 Benchmark]: Toolchain (without parser) took 650904.57 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.2 MB in the beginning and 16.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,251 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 39.8 MB. Free memory was 17.6 MB in the beginning and 17.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:09:36,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.63 ms. Allocated memory is still 48.2 MB. Free memory was 25.1 MB in the beginning and 26.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.29 ms. Allocated memory is still 48.2 MB. Free memory was 26.3 MB in the beginning and 25.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,254 INFO L168 Benchmark]: Boogie Preprocessor took 31.99 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 23.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:09:36,255 INFO L168 Benchmark]: RCFGBuilder took 601.23 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 23.9 MB in the end (delta: -255.1 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,256 INFO L168 Benchmark]: TraceAbstraction took 649873.27 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.6 MB in the beginning and 20.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,263 INFO L168 Benchmark]: Witness Printer took 74.82 ms. Allocated memory is still 58.7 MB. Free memory was 20.4 MB in the beginning and 16.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-03 18:09:36,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 39.8 MB. Free memory was 17.6 MB in the beginning and 17.5 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 275.63 ms. Allocated memory is still 48.2 MB. Free memory was 25.1 MB in the beginning and 26.3 MB in the end (delta: -1.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.29 ms. Allocated memory is still 48.2 MB. Free memory was 26.3 MB in the beginning and 25.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.99 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 23.8 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 601.23 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 23.9 MB in the end (delta: -255.1 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 649873.27 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.6 MB in the beginning and 20.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * Witness Printer took 74.82 ms. Allocated memory is still 58.7 MB. Free memory was 20.4 MB in the beginning and 16.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-12-03 18:09:36,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,289 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,311 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-12-03 18:09:36,311 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((((((!~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == main__i) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick)) || ((((0bv32 == ~bvadd64(main__i, 4294967289bv32) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick))) || ((((!~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick)) && 0bv32 == ~bvadd64(main__i, 4294967294bv32))) || (((main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 4bv32 == main__i)) || (((main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)) && 0bv32 == ~bvadd64(main__i, 4294967291bv32)) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || (((main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)) && ~bvadd64(main__i, 4294967293bv32) == 0bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick))) || (((main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && 0bv32 == ~bvadd64(main__i, 4294967286bv32)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)))) || (((main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 6bv32 == main__i)) || (((9bv32 == main__i && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick))) || (((0bv32 == ~bvadd64(main__i, 4294967288bv32) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick))) || (((main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE())) && 0bv32 == main__i) - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 140.7s, OverallIterations: 5, TraceHistogramMax: 12, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 508.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 23 SDtfs, 1 SDslu, 60 SDs, 0 SdLazy, 213 SolverSat, 25 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 127.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 516 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 217 FormulaSimplificationTreeSizeReductionInter, 508.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 102.3s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 12564 SizeOfPredicates, 7 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 46/288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...