./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/drift_tenth.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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 ../sv-benchmarks/c/float-benchs/drift_tenth.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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:20:19,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:20:19,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:20:19,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:20:19,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:20:19,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:20:19,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:20:19,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:20:19,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:20:19,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:20:19,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:20:19,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:20:19,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:20:19,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:20:19,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:20:19,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:20:19,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:20:19,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:20:19,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:20:19,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:20:19,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:20:19,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:20:19,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:20:19,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:20:19,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:20:19,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:20:19,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:20:19,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:20:19,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:20:19,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:20:19,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:20:19,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:20:19,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:20:19,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:20:19,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:20:19,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:20:19,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:20:19,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:20:19,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:20:19,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:20:19,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:20:19,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 06:20:19,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:20:19,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:20:19,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:20:19,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:20:19,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:20:19,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:20:19,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:20:19,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:20:19,525 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:20:19,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:20:19,526 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:20:19,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 06:20:19,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:20:19,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:20:19,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:20:19,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:20:19,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:20:19,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:20:19,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:20:19,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:19,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:20:19,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:20:19,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:20:19,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 06:20:19,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 06:20:19,530 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:20:19,530 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:20:19,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:20:19,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:20:19,530 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2021-12-17 06:20:19,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:20:19,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:20:19,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:20:19,711 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:20:19,711 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:20:19,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c [2021-12-17 06:20:19,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e1aa6c5/da5dc16afd7a4192a20959a525559d06/FLAGc86f25bd1 [2021-12-17 06:20:20,099 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:20:20,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c [2021-12-17 06:20:20,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e1aa6c5/da5dc16afd7a4192a20959a525559d06/FLAGc86f25bd1 [2021-12-17 06:20:20,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e1aa6c5/da5dc16afd7a4192a20959a525559d06 [2021-12-17 06:20:20,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:20:20,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:20:20,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:20,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:20:20,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:20:20,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4323c517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:20:20,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:20:20,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2021-12-17 06:20:20,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:20,249 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:20:20,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2021-12-17 06:20:20,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:20,265 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:20:20,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20 WrapperNode [2021-12-17 06:20:20,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:20,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:20,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:20:20,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:20:20,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,289 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2021-12-17 06:20:20,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:20,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:20:20,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:20:20,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:20:20,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:20:20,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:20:20,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:20:20,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:20:20,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:20,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:20,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:20:20,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:20:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:20:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:20:20,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:20:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 06:20:20,394 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:20:20,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:20:20,446 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:20:20,450 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:20:20,450 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 06:20:20,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20 BoogieIcfgContainer [2021-12-17 06:20:20,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:20:20,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:20:20,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:20:20,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:20:20,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:20:20" (1/3) ... [2021-12-17 06:20:20,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e90787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (2/3) ... [2021-12-17 06:20:20,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e90787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20" (3/3) ... [2021-12-17 06:20:20,459 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2021-12-17 06:20:20,462 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:20:20,462 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:20:20,500 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:20:20,506 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:20:20,507 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:20:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 06:20:20,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:20,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 06:20:20,534 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2021-12-17 06:20:20,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:20,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452516645] [2021-12-17 06:20:20,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:20,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:20,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:20,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452516645] [2021-12-17 06:20:20,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452516645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:20:20,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:20:20,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:20:20,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911603183] [2021-12-17 06:20:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:20:20,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:20:20,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:20:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:20,737 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:20,752 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-12-17 06:20:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:20:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-17 06:20:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:20,758 INFO L225 Difference]: With dead ends: 22 [2021-12-17 06:20:20,758 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 06:20:20,760 INFO L932 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 [2021-12-17 06:20:20,763 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:20,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 06:20:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-12-17 06:20:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-12-17 06:20:20,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2021-12-17 06:20:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:20,786 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-12-17 06:20:20,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-12-17 06:20:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 06:20:20,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:20,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:20:20,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 06:20:20,789 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:20,792 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2021-12-17 06:20:20,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:20,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110506000] [2021-12-17 06:20:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:20,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:20,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:20,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110506000] [2021-12-17 06:20:20,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110506000] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:20:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449584073] [2021-12-17 06:20:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:20,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:20,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 06:20:20,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 06:20:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:20,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:20:20,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:20,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:20,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449584073] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:20,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 06:20:20,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-17 06:20:20,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541656649] [2021-12-17 06:20:20,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:20,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 06:20:20,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 06:20:20,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:20,975 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:20,998 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-12-17 06:20:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:20:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 06:20:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:20,999 INFO L225 Difference]: With dead ends: 19 [2021-12-17 06:20:21,000 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 06:20:21,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:21,002 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:21,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 06:20:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 06:20:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-12-17 06:20:21,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2021-12-17 06:20:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:21,015 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-12-17 06:20:21,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-12-17 06:20:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:20:21,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:21,021 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2021-12-17 06:20:21,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:21,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:21,236 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2021-12-17 06:20:21,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:21,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864895463] [2021-12-17 06:20:21,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:21,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:21,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864895463] [2021-12-17 06:20:21,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864895463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:20:21,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51111782] [2021-12-17 06:20:21,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 06:20:21,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:21,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:21,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 06:20:21,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 06:20:21,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 06:20:21,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:20:21,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 06:20:21,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51111782] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:21,427 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 06:20:21,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-17 06:20:21,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298603671] [2021-12-17 06:20:21,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:21,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 06:20:21,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:21,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 06:20:21,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-17 06:20:21,429 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:21,467 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-17 06:20:21,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:20:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 06:20:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:21,469 INFO L225 Difference]: With dead ends: 31 [2021-12-17 06:20:21,469 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 06:20:21,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-17 06:20:21,472 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:21,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:21,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 06:20:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-17 06:20:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-12-17 06:20:21,481 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2021-12-17 06:20:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:21,482 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-12-17 06:20:21,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-12-17 06:20:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 06:20:21,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:21,483 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-12-17 06:20:21,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-17 06:20:21,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 06:20:21,696 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:21,697 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2021-12-17 06:20:21,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095136683] [2021-12-17 06:20:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:21,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:20:21,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 06:20:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:20:21,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 06:20:21,744 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 06:20:21,745 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:20:21,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 06:20:21,748 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1] [2021-12-17 06:20:21,749 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:20:21,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:20:21 BoogieIcfgContainer [2021-12-17 06:20:21,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:20:21,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:20:21,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:20:21,777 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:20:21,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20" (3/4) ... [2021-12-17 06:20:21,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 06:20:21,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:20:21,779 INFO L158 Benchmark]: Toolchain (without parser) took 1659.43ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 76.8MB in the beginning and 102.1MB in the end (delta: -25.3MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2021-12-17 06:20:21,780 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:21,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.27ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 76.4MB in the beginning and 108.8MB in the end (delta: -32.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:20:21,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.98ms. Allocated memory is still 132.1MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:20:21,780 INFO L158 Benchmark]: Boogie Preprocessor took 18.71ms. Allocated memory is still 132.1MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:21,780 INFO L158 Benchmark]: RCFGBuilder took 141.26ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 96.8MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:20:21,781 INFO L158 Benchmark]: TraceAbstraction took 1322.99ms. Allocated memory is still 132.1MB. Free memory was 96.8MB in the beginning and 102.1MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:21,781 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 132.1MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:21,782 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.18ms. Allocated memory is still 104.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.27ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 76.4MB in the beginning and 108.8MB in the end (delta: -32.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.98ms. Allocated memory is still 132.1MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.71ms. Allocated memory is still 132.1MB. Free memory was 106.7MB in the beginning and 105.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 141.26ms. Allocated memory is still 132.1MB. Free memory was 105.7MB in the beginning and 96.8MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1322.99ms. Allocated memory is still 132.1MB. Free memory was 96.8MB in the beginning and 102.1MB in the end (delta: -5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 132.1MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6]: 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 17, overapproximation of someBinaryArithmeticFLOAToperation at line 15. Possible FailurePath: [L10] float tick = 1.f / 10.f; [L11] float time = 0.f; [L12] int i; [L14] i = 0 VAL [i=0, time=0] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=0] [L14] i++ VAL [i=1] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=1] [L14] i++ VAL [i=2] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=2] [L14] i++ VAL [i=3] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=3] [L14] i++ VAL [i=4] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=4] [L14] i++ VAL [i=5] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=5] [L14] i++ VAL [i=6] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=6] [L14] i++ VAL [i=7] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=7] [L14] i++ VAL [i=8] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=8] [L14] i++ VAL [i=9] [L14] COND TRUE i < 10 [L15] time += tick VAL [i=9] [L14] i++ VAL [i=10] [L14] COND FALSE !(i < 10) VAL [i=10] [L17] CALL __VERIFIER_assert(time != 1.0) [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 22 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/51 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 [2021-12-17 06:20:21,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../sv-benchmarks/c/float-benchs/drift_tenth.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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:20:23,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:20:23,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:20:23,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:20:23,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:20:23,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:20:23,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:20:23,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:20:23,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:20:23,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:20:23,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:20:23,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:20:23,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:20:23,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:20:23,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:20:23,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:20:23,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:20:23,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:20:23,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:20:23,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:20:23,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:20:23,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:20:23,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:20:23,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:20:23,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:20:23,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:20:23,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:20:23,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:20:23,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:20:23,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:20:23,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:20:23,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:20:23,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:20:23,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:20:23,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:20:23,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:20:23,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:20:23,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:20:23,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:20:23,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:20:23,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:20:23,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 06:20:23,518 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:20:23,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:20:23,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:20:23,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:20:23,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:20:23,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:20:23,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:20:23,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:20:23,521 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:20:23,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:20:23,522 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:20:23,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:20:23,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:23,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:20:23,524 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:20:23,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 06:20:23,526 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2021-12-17 06:20:23,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:20:23,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:20:23,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:20:23,807 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:20:23,808 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:20:23,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c [2021-12-17 06:20:23,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e7aeaca/7bde13b4be1f4ef990f50549425e86be/FLAG309aec508 [2021-12-17 06:20:24,197 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:20:24,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c [2021-12-17 06:20:24,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e7aeaca/7bde13b4be1f4ef990f50549425e86be/FLAG309aec508 [2021-12-17 06:20:24,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e7aeaca/7bde13b4be1f4ef990f50549425e86be [2021-12-17 06:20:24,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:20:24,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:20:24,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:24,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:20:24,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:20:24,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a304a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24, skipping insertion in model container [2021-12-17 06:20:24,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:20:24,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:20:24,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2021-12-17 06:20:24,329 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:24,335 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:20:24,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2021-12-17 06:20:24,344 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:24,352 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:20:24,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24 WrapperNode [2021-12-17 06:20:24,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:24,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:24,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:20:24,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:20:24,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,401 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-12-17 06:20:24,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:24,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:20:24,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:20:24,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:20:24,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:20:24,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:20:24,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:20:24,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:20:24,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (1/1) ... [2021-12-17 06:20:24,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:24,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:20:24,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:20:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:20:24,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:20:24,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:20:24,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 06:20:24,514 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:20:24,515 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:20:24,671 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:20:24,675 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:20:24,675 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 06:20:24,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:24 BoogieIcfgContainer [2021-12-17 06:20:24,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:20:24,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:20:24,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:20:24,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:20:24,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:20:24" (1/3) ... [2021-12-17 06:20:24,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19de9f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:24, skipping insertion in model container [2021-12-17 06:20:24,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:24" (2/3) ... [2021-12-17 06:20:24,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19de9f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:24, skipping insertion in model container [2021-12-17 06:20:24,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:24" (3/3) ... [2021-12-17 06:20:24,681 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2021-12-17 06:20:24,684 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:20:24,684 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:20:24,716 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:20:24,731 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:20:24,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:20:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 06:20:24,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:24,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 06:20:24,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2021-12-17 06:20:24,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:24,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717794989] [2021-12-17 06:20:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:24,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:24,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:24,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:24,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 06:20:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:24,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:20:24,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:24,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:20:24,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:20:24,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717794989] [2021-12-17 06:20:24,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717794989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:20:24,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:20:24,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:20:24,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639151715] [2021-12-17 06:20:24,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:20:24,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:20:24,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:20:24,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:20:24,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:24,906 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:24,995 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-12-17 06:20:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:20:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-17 06:20:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:25,005 INFO L225 Difference]: With dead ends: 22 [2021-12-17 06:20:25,005 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 06:20:25,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:25,011 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:25,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 06:20:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 06:20:25,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2021-12-17 06:20:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:25,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-12-17 06:20:25,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2021-12-17 06:20:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:25,035 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-12-17 06:20:25,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-12-17 06:20:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-17 06:20:25,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:25,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:20:25,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:25,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:20:25,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2021-12-17 06:20:25,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:25,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571884568] [2021-12-17 06:20:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:25,241 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:25,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:25,244 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:25,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 06:20:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:25,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:20:25,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:25,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:25,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:20:25,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571884568] [2021-12-17 06:20:25,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571884568] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:25,379 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:20:25,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 06:20:25,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75170136] [2021-12-17 06:20:25,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:25,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 06:20:25,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:20:25,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 06:20:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 06:20:25,386 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:25,597 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-12-17 06:20:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:20:25,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-17 06:20:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:25,599 INFO L225 Difference]: With dead ends: 19 [2021-12-17 06:20:25,599 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 06:20:25,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:25,600 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:25,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 06:20:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 06:20:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 06:20:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-12-17 06:20:25,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2021-12-17 06:20:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:25,604 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-12-17 06:20:25,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-12-17 06:20:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:20:25,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:25,613 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2021-12-17 06:20:25,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:25,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:20:25,819 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:25,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2021-12-17 06:20:25,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:25,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234661501] [2021-12-17 06:20:25,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 06:20:25,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:25,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:25,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:25,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 06:20:25,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 06:20:25,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:20:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 06:20:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:29,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:21:10,728 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:21:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 4 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-17 06:21:11,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:21:11,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234661501] [2021-12-17 06:21:11,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234661501] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:21:11,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:21:11,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-17 06:21:11,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023707306] [2021-12-17 06:21:11,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:21:11,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-17 06:21:11,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:21:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-17 06:21:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=4, NotChecked=24, Total=210 [2021-12-17 06:21:11,229 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:21:14,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:21:18,517 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:21:49,381 WARN L227 SmtUtils]: Spent 19.64s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:21:52,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:21:54,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:21:56,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:22:21,814 WARN L227 SmtUtils]: Spent 13.42s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:22:23,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:22:57,776 WARN L227 SmtUtils]: Spent 24.67s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:22:59,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:01,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:03,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:05,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:20,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:41,272 WARN L227 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:23:43,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:45,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:47,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:49,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:51,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:53,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:55,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:03,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:04,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:24:23,479 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-12-17 06:24:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 06:24:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 06:24:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:24:23,480 INFO L225 Difference]: With dead ends: 33 [2021-12-17 06:24:23,480 INFO L226 Difference]: Without dead ends: 23 [2021-12-17 06:24:23,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 180.1s TimeCoverageRelationStatistics Valid=139, Invalid=312, Unknown=15, NotChecked=40, Total=506 [2021-12-17 06:24:23,481 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 18 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 45.2s IncrementalHoareTripleChecker+Time [2021-12-17 06:24:23,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 47 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 50 Invalid, 15 Unknown, 22 Unchecked, 45.2s Time] [2021-12-17 06:24:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-17 06:24:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-17 06:24:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-12-17 06:24:23,484 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 14 [2021-12-17 06:24:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:24:23,485 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-12-17 06:24:23,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-12-17 06:24:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-17 06:24:23,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:24:23,486 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2021-12-17 06:24:23,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 06:24:23,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:24:23,691 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:24:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:24:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash -248120899, now seen corresponding path program 3 times [2021-12-17 06:24:23,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:24:23,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726883741] [2021-12-17 06:24:23,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 06:24:23,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:24:23,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:24:23,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:24:23,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 06:24:23,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-12-17 06:24:23,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:24:23,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 06:24:23,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:24:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:24:24,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:24:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:24:24,616 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:24:24,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726883741] [2021-12-17 06:24:24,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726883741] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:24:24,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:24:24,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-17 06:24:24,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425407571] [2021-12-17 06:24:24,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:24:24,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 06:24:24,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:24:24,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 06:24:24,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-17 06:24:24,619 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:24:25,731 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2021-12-17 06:24:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:24:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-17 06:24:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:24:25,734 INFO L225 Difference]: With dead ends: 31 [2021-12-17 06:24:25,734 INFO L226 Difference]: Without dead ends: 27 [2021-12-17 06:24:25,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-17 06:24:25,735 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:24:25,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-17 06:24:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-17 06:24:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-17 06:24:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-12-17 06:24:25,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2021-12-17 06:24:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:24:25,740 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-12-17 06:24:25,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-12-17 06:24:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 06:24:25,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:24:25,741 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2021-12-17 06:24:25,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-17 06:24:25,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:24:25,947 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:24:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:24:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 4 times [2021-12-17 06:24:25,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:24:25,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259537065] [2021-12-17 06:24:25,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 06:24:25,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:24:25,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:24:25,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:24:25,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 06:24:26,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 06:24:26,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:24:26,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 06:24:26,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:25:23,518 WARN L227 SmtUtils]: Spent 6.59s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:25:52,892 WARN L227 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:25:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 96 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:25:58,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:26:23,042 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:26:31,993 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:27:18,174 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:27:27,444 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:27:29,479 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:27:41,309 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:27:48,897 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:27:50,940 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:28:01,174 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:28:03,225 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:28:09,347 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:28:11,388 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:28:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 6 refuted. 6 times theorem prover too weak. 0 trivial. 88 not checked. [2021-12-17 06:28:11,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:28:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259537065] [2021-12-17 06:28:11,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259537065] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:28:11,389 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:28:11,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-12-17 06:28:11,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417592459] [2021-12-17 06:28:11,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:28:11,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 06:28:11,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:28:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 06:28:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=280, Unknown=25, NotChecked=344, Total=756 [2021-12-17 06:28:11,390 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:28:13,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:15,464 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:17,521 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:19,572 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:21,619 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:23,658 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 |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) is different from true [2021-12-17 06:28:25,712 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:28,852 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:28:31,733 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~time~0#1| (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 (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)))) is different from true [2021-12-17 06:28:33,784 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~time~0#1| (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 (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= 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_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) is different from true [2021-12-17 06:28:35,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:39,740 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= |c_ULTIMATE.start_main_~time~0#1| (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.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 (_ +zero 8 24) .cse2) .cse2) .cse2) .cse2) .cse2) .cse2) .cse2) .cse2) .cse2) .cse2))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1))))) is different from true [2021-12-17 06:28:42,697 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1))))) is different from true [2021-12-17 06:28:44,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:48,306 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) .cse1)))) is different from true [2021-12-17 06:28:50,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:28:52,847 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)))) is different from true [2021-12-17 06:29:08,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:10,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:12,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:14,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:16,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:18,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:20,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:22,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:24,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:27,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:29,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:29:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:29:29,632 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-12-17 06:29:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 06:29:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 06:29:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:29:29,656 INFO L225 Difference]: With dead ends: 44 [2021-12-17 06:29:29,656 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 06:29:29,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 172.4s TimeCoverageRelationStatistics Valid=147, Invalid=316, Unknown=41, NotChecked=1218, Total=1722 [2021-12-17 06:29:29,658 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2021-12-17 06:29:29,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 14 Unknown, 275 Unchecked, 32.9s Time] [2021-12-17 06:29:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 06:29:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-17 06:29:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:29:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-12-17 06:29:29,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 26 [2021-12-17 06:29:29,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:29:29,662 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-12-17 06:29:29,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:29:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-12-17 06:29:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 06:29:29,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:29:29,663 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2021-12-17 06:29:29,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 06:29:29,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:29:29,869 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:29:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:29:29,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1283937721, now seen corresponding path program 5 times [2021-12-17 06:29:29,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:29:29,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496705065] [2021-12-17 06:29:29,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 06:29:29,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:29:29,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:29:29,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:29:29,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 06:29:30,192 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2021-12-17 06:29:30,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:29:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 06:29:30,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:29:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 63 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 06:29:30,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:29:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 63 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 06:29:32,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:29:32,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496705065] [2021-12-17 06:29:32,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496705065] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:29:32,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:29:32,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-17 06:29:32,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221769462] [2021-12-17 06:29:32,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:29:32,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 06:29:32,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:29:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 06:29:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-17 06:29:32,133 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:29:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:29:34,205 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2021-12-17 06:29:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 06:29:34,207 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-17 06:29:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:29:34,207 INFO L225 Difference]: With dead ends: 39 [2021-12-17 06:29:34,207 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 06:29:34,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-17 06:29:34,208 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:29:34,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-17 06:29:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 06:29:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 06:29:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:29:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 06:29:34,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-12-17 06:29:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:29:34,209 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 06:29:34,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:29:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 06:29:34,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 06:29:34,211 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:29:34,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 06:29:34,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:29:34,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Killed by 15