./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:08:25,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:08:25,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:08:25,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:08:25,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:08:25,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:08:25,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:08:25,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:08:25,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:08:25,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:08:25,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:08:25,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:08:25,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:08:25,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:08:25,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:08:25,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:08:25,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:08:25,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:08:25,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:08:25,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:08:25,665 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:08:25,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:08:25,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:08:25,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:08:25,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:08:25,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:08:25,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:08:25,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:08:25,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:08:25,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:08:25,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:08:25,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:08:25,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:08:25,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:08:25,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:08:25,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:08:25,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:08:25,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:08:25,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:08:25,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:08:25,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:08:25,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:08:25,686 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:08:25,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:08:25,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:08:25,711 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:08:25,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:08:25,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:08:25,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:08:25,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:08:25,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:08:25,713 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:08:25,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:08:25,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:08:25,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:08:25,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:08:25,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:08:25,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:08:25,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:08:25,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:08:25,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:08:25,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:08:25,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:08:25,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:08:25,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:08:25,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:08:25,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:08:25,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:08:25,729 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:08:25,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:08:25,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:08:25,729 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-07-21 01:08:25,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:08:25,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:08:25,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:08:25,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:08:26,000 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:08:26,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:26,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408d05c8a/4f12d144bf5145a88b79b68ec25883ab/FLAG831a23809 [2022-07-21 01:08:26,372 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:08:26,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:26,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408d05c8a/4f12d144bf5145a88b79b68ec25883ab/FLAG831a23809 [2022-07-21 01:08:26,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408d05c8a/4f12d144bf5145a88b79b68ec25883ab [2022-07-21 01:08:26,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:08:26,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:08:26,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:08:26,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:08:26,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:08:26,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7d313c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26, skipping insertion in model container [2022-07-21 01:08:26,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:08:26,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:08:26,518 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.p+cfa-reducer.c[721,734] [2022-07-21 01:08:26,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:08:26,531 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:08:26,545 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.p+cfa-reducer.c[721,734] [2022-07-21 01:08:26,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:08:26,561 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:08:26,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26 WrapperNode [2022-07-21 01:08:26,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:08:26,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:08:26,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:08:26,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:08:26,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,583 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-07-21 01:08:26,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:08:26,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:08:26,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:08:26,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:08:26,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:08:26,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:08:26,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:08:26,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:08:26,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (1/1) ... [2022-07-21 01:08:26,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:08:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:08:26,633 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) [2022-07-21 01:08:26,672 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 [2022-07-21 01:08:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:08:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:08:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:08:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:08:26,739 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:08:26,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:08:26,820 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:08:26,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:08:26,826 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 01:08:26,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:08:26 BoogieIcfgContainer [2022-07-21 01:08:26,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:08:26,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:08:26,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:08:26,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:08:26,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:08:26" (1/3) ... [2022-07-21 01:08:26,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67571620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:08:26, skipping insertion in model container [2022-07-21 01:08:26,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:26" (2/3) ... [2022-07-21 01:08:26,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67571620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:08:26, skipping insertion in model container [2022-07-21 01:08:26,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:08:26" (3/3) ... [2022-07-21 01:08:26,833 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:26,842 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:08:26,843 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:08:26,889 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:08:26,895 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e45a3e2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3dc95a3c [2022-07-21 01:08:26,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:08:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2022-07-21 01:08:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 01:08:26,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:26,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 01:08:26,915 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:26,919 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-21 01:08:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:08:26,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242708400] [2022-07-21 01:08:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:08:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:08:27,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242708400] [2022-07-21 01:08:27,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242708400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:08:27,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:08:27,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:08:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252172998] [2022-07-21 01:08:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:08:27,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:08:27,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:08:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:08:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:08:27,089 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-21 01:08:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:27,105 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-21 01:08:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:08:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-07-21 01:08:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:27,129 INFO L225 Difference]: With dead ends: 16 [2022-07-21 01:08:27,143 INFO L226 Difference]: Without dead ends: 7 [2022-07-21 01:08:27,145 INFO L412 NwaCegarLoop]: 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 [2022-07-21 01:08:27,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:27,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:08:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-07-21 01:08:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-21 01:08:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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) [2022-07-21 01:08:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-07-21 01:08:27,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-07-21 01:08:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:27,183 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-07-21 01:08:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-21 01:08:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-07-21 01:08:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:08:27,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:27,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:08:27,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:08:27,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-07-21 01:08:27,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:08:27,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79635544] [2022-07-21 01:08:27,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:27,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:08:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:08:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79635544] [2022-07-21 01:08:27,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79635544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:08:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487140815] [2022-07-21 01:08:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:27,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:08:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:08:27,260 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) [2022-07-21 01:08:27,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 01:08:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:27,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:08:27,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:08:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:08:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487140815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:08:27,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:08:27,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-21 01:08:27,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739454858] [2022-07-21 01:08:27,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:08:27,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 01:08:27,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:08:27,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 01:08:27,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:08:27,368 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-21 01:08:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:27,384 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-21 01:08:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:08:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 [2022-07-21 01:08:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:27,385 INFO L225 Difference]: With dead ends: 13 [2022-07-21 01:08:27,385 INFO L226 Difference]: Without dead ends: 10 [2022-07-21 01:08:27,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:08:27,386 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:27,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:08:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-21 01:08:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-21 01:08:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2022-07-21 01:08:27,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-21 01:08:27,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-07-21 01:08:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:27,390 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-21 01:08:27,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-07-21 01:08:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-21 01:08:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:08:27,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:27,391 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-21 01:08:27,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 01:08:27,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:08:27,608 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-07-21 01:08:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:08:27,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552746442] [2022-07-21 01:08:27,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:08:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:08:27,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552746442] [2022-07-21 01:08:27,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552746442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:08:27,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912350687] [2022-07-21 01:08:27,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:08:27,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:08:27,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:08:27,693 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) [2022-07-21 01:08:27,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 01:08:27,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:08:27,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:08:27,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 01:08:27,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:08:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:08:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:27,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912350687] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:08:27,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 01:08:27,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-21 01:08:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923058349] [2022-07-21 01:08:27,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 01:08:27,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 01:08:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:08:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 01:08:27,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-21 01:08:27,847 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-07-21 01:08:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:27,874 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-07-21 01:08:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:08:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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 9 [2022-07-21 01:08:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:27,875 INFO L225 Difference]: With dead ends: 19 [2022-07-21 01:08:27,875 INFO L226 Difference]: Without dead ends: 16 [2022-07-21 01:08:27,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-21 01:08:27,877 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:27,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:08:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-21 01:08:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-21 01:08:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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) [2022-07-21 01:08:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-21 01:08:27,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-07-21 01:08:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:27,881 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-21 01:08:27,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-07-21 01:08:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-21 01:08:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:08:27,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:27,882 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-07-21 01:08:27,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:08:28,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 01:08:28,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-07-21 01:08:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:08:28,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277287308] [2022-07-21 01:08:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:08:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:08:28,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:08:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:08:28,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:08:28,156 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:08:28,157 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:08:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 01:08:28,161 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1] [2022-07-21 01:08:28,165 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:08:28,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:08:28 BoogieIcfgContainer [2022-07-21 01:08:28,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:08:28,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:08:28,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:08:28,205 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:08:28,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:08:26" (3/4) ... [2022-07-21 01:08:28,207 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:08:28,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:08:28,208 INFO L158 Benchmark]: Toolchain (without parser) took 1820.42ms. Allocated memory is still 81.8MB. Free memory was 48.0MB in the beginning and 36.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-07-21 01:08:28,208 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:08:28,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.95ms. Allocated memory is still 81.8MB. Free memory was 47.9MB in the beginning and 66.5MB in the end (delta: -18.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-21 01:08:28,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.51ms. Allocated memory is still 81.8MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:08:28,209 INFO L158 Benchmark]: Boogie Preprocessor took 18.03ms. Allocated memory is still 81.8MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:08:28,209 INFO L158 Benchmark]: RCFGBuilder took 217.56ms. Allocated memory is still 81.8MB. Free memory was 64.1MB in the beginning and 55.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 01:08:28,210 INFO L158 Benchmark]: TraceAbstraction took 1375.46ms. Allocated memory is still 81.8MB. Free memory was 55.1MB in the beginning and 37.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-07-21 01:08:28,210 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 81.8MB. Free memory is still 36.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:08:28,212 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.17ms. Allocated memory is still 81.8MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.95ms. Allocated memory is still 81.8MB. Free memory was 47.9MB in the beginning and 66.5MB in the end (delta: -18.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.51ms. Allocated memory is still 81.8MB. Free memory was 66.5MB in the beginning and 65.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.03ms. Allocated memory is still 81.8MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 217.56ms. Allocated memory is still 81.8MB. Free memory was 64.1MB in the beginning and 55.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1375.46ms. Allocated memory is still 81.8MB. Free memory was 55.1MB in the beginning and 37.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 81.8MB. Free memory is still 36.9MB. 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: 29]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L29] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 18 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 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 [2022-07-21 01:08:28,241 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.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:08:30,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:08:30,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:08:30,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:08:30,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:08:30,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:08:30,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:08:30,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:08:30,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:08:30,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:08:30,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:08:30,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:08:30,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:08:30,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:08:30,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:08:30,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:08:30,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:08:30,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:08:30,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:08:30,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:08:30,129 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:08:30,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:08:30,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:08:30,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:08:30,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:08:30,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:08:30,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:08:30,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:08:30,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:08:30,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:08:30,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:08:30,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:08:30,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:08:30,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:08:30,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:08:30,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:08:30,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:08:30,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:08:30,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:08:30,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:08:30,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:08:30,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:08:30,144 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:08:30,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:08:30,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:08:30,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:08:30,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:08:30,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:08:30,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:08:30,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:08:30,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:08:30,172 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:08:30,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:08:30,173 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:08:30,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:08:30,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:08:30,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:08:30,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:08:30,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:08:30,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:08:30,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:08:30,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:08:30,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:08:30,177 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2022-07-21 01:08:30,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:08:30,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:08:30,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:08:30,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:08:30,503 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:08:30,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:30,548 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d354c784/44f8de8c7f64476dbd687c6225b39f56/FLAGcb17d4317 [2022-07-21 01:08:30,910 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:08:30,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:30,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d354c784/44f8de8c7f64476dbd687c6225b39f56/FLAGcb17d4317 [2022-07-21 01:08:30,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d354c784/44f8de8c7f64476dbd687c6225b39f56 [2022-07-21 01:08:30,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:08:30,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:08:30,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:08:30,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:08:30,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:08:30,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:08:30" (1/1) ... [2022-07-21 01:08:30,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec559a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:30, skipping insertion in model container [2022-07-21 01:08:30,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:08:30" (1/1) ... [2022-07-21 01:08:30,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:08:30,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:08:31,093 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.p+cfa-reducer.c[721,734] [2022-07-21 01:08:31,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:08:31,106 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:08:31,118 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.p+cfa-reducer.c[721,734] [2022-07-21 01:08:31,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:08:31,138 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:08:31,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31 WrapperNode [2022-07-21 01:08:31,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:08:31,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:08:31,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:08:31,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:08:31,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,171 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-07-21 01:08:31,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:08:31,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:08:31,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:08:31,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:08:31,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:08:31,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:08:31,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:08:31,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:08:31,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (1/1) ... [2022-07-21 01:08:31,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:08:31,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:08:31,261 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) [2022-07-21 01:08:31,326 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 [2022-07-21 01:08:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:08:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:08:31,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:08:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:08:31,411 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:08:31,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:08:31,594 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:08:31,598 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:08:31,598 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 01:08:31,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:08:31 BoogieIcfgContainer [2022-07-21 01:08:31,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:08:31,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:08:31,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:08:31,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:08:31,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:08:30" (1/3) ... [2022-07-21 01:08:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c6675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:08:31, skipping insertion in model container [2022-07-21 01:08:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:08:31" (2/3) ... [2022-07-21 01:08:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c6675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:08:31, skipping insertion in model container [2022-07-21 01:08:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:08:31" (3/3) ... [2022-07-21 01:08:31,605 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-07-21 01:08:31,614 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:08:31,615 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:08:31,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:08:31,672 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f8d9139, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62e0d54e [2022-07-21 01:08:31,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:08:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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) [2022-07-21 01:08:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-21 01:08:31,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:31,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-21 01:08:31,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-07-21 01:08:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:08:31,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973454319] [2022-07-21 01:08:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:31,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:08:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:08:31,712 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) [2022-07-21 01:08:31,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:08:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:31,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 01:08:31,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:08:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:31,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:08:31,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:08:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973454319] [2022-07-21 01:08:31,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973454319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:08:31,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:08:31,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 01:08:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687844254] [2022-07-21 01:08:31,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:08:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 01:08:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:08:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 01:08:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:08:31,895 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 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 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-21 01:08:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:31,996 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-21 01:08:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 01:08:32,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-07-21 01:08:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:32,005 INFO L225 Difference]: With dead ends: 16 [2022-07-21 01:08:32,005 INFO L226 Difference]: Without dead ends: 7 [2022-07-21 01:08:32,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 01:08:32,009 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:32,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 01:08:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-07-21 01:08:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-07-21 01:08:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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) [2022-07-21 01:08:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-07-21 01:08:32,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-07-21 01:08:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:32,029 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-07-21 01:08:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-21 01:08:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-07-21 01:08:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 01:08:32,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:32,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 01:08:32,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 01:08:32,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:08:32,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:32,239 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-07-21 01:08:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:08:32,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396148724] [2022-07-21 01:08:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:08:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:08:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:08:32,241 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) [2022-07-21 01:08:32,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:08:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:08:32,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 01:08:32,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:08:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:32,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:08:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:32,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:08:32,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396148724] [2022-07-21 01:08:32,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396148724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:08:32,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:08:32,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 01:08:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229814085] [2022-07-21 01:08:32,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:08:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 01:08:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:08:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 01:08:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 01:08:32,405 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2022-07-21 01:08:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:32,663 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-21 01:08:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 01:08:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) Word has length 6 [2022-07-21 01:08:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:32,668 INFO L225 Difference]: With dead ends: 13 [2022-07-21 01:08:32,668 INFO L226 Difference]: Without dead ends: 10 [2022-07-21 01:08:32,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-21 01:08:32,669 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:32,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 01:08:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-21 01:08:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-21 01:08:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) [2022-07-21 01:08:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-21 01:08:32,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-07-21 01:08:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:32,672 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-21 01:08:32,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2022-07-21 01:08:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-21 01:08:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-21 01:08:32,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:32,673 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-07-21 01:08:32,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 01:08:32,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:08:32,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-07-21 01:08:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:08:32,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617888787] [2022-07-21 01:08:32,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:08:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:08:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:08:32,880 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) [2022-07-21 01:08:32,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:08:32,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:08:32,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:08:32,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 01:08:32,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:08:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:33,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:08:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:08:33,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:08:33,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617888787] [2022-07-21 01:08:33,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617888787] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:08:33,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:08:33,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-21 01:08:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548971482] [2022-07-21 01:08:33,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:08:33,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 01:08:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:08:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 01:08:33,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 01:08:33,123 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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) [2022-07-21 01:08:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:08:33,605 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-07-21 01:08:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:08:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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 9 [2022-07-21 01:08:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:08:33,609 INFO L225 Difference]: With dead ends: 19 [2022-07-21 01:08:33,609 INFO L226 Difference]: Without dead ends: 16 [2022-07-21 01:08:33,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-21 01:08:33,610 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 01:08:33,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 01:08:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-21 01:08:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-21 01:08:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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) [2022-07-21 01:08:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-07-21 01:08:33,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-07-21 01:08:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:08:33,615 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-07-21 01:08:33,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 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) [2022-07-21 01:08:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-07-21 01:08:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-21 01:08:33,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:08:33,616 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-07-21 01:08:33,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:08:33,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:08:33,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:08:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:08:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-07-21 01:08:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:08:33,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002414132] [2022-07-21 01:08:33,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 01:08:33,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:08:33,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:08:33,829 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) [2022-07-21 01:08:33,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:08:34,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-21 01:08:34,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:08:34,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 01:08:34,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:09:33,509 WARN L233 SmtUtils]: Spent 6.78s 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) [2022-07-21 01:10:03,394 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-21 01:10:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 44 refuted. 11 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:10:03,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:10:52,101 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-21 01:10:54,127 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:01,479 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:08,645 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:15,150 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:21,273 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-21 01:11:23,316 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:28,049 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-21 01:11:30,097 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:34,716 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-21 01:11:36,767 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:42,909 WARN L833 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-07-21 01:11:44,951 WARN L855 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-07-21 01:11:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 49 not checked. [2022-07-21 01:11:44,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:11:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002414132] [2022-07-21 01:11:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002414132] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:11:44,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:11:44,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-07-21 01:11:44,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027785348] [2022-07-21 01:11:44,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:11:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 01:11:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:11:44,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 01:11:44,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=32, NotChecked=344, Total=756 [2022-07-21 01:11:44,954 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-07-21 01:11:48,960 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:11:51,017 WARN L855 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-07-21 01:11:53,087 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:11:55,143 WARN L855 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:11:57,253 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:11:59,292 WARN L855 $PredicateComparison]: unable to prove that (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~0#1|) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.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_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:12:01,329 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__time~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 |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-07-21 01:12:17,949 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~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 .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1))))) is different from true [2022-07-21 01:12:21,367 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~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_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)))) is different from true [2022-07-21 01:12:33,527 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 [] [2022-07-21 01:12:35,541 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 [] [2022-07-21 01:12:37,822 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 [] [2022-07-21 01:12:40,678 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 [] [2022-07-21 01:12:42,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:12:53,548 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 [] [2022-07-21 01:12:54,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:12:56,625 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 [] [2022-07-21 01:12:58,651 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 [] [2022-07-21 01:12:59,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:13:07,822 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 [] [2022-07-21 01:13:09,845 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 [] [2022-07-21 01:13:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:13:10,017 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-21 01:13:10,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 01:13:10,018 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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 15 [2022-07-21 01:13:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:13:10,018 INFO L225 Difference]: With dead ends: 26 [2022-07-21 01:13:10,018 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 01:13:10,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 197.2s TimeCoverageRelationStatistics Valid=151, Invalid=377, Unknown=46, NotChecked=986, Total=1560 [2022-07-21 01:13:10,019 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-07-21 01:13:10,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 17 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 9 Unknown, 74 Unchecked, 28.1s Time] [2022-07-21 01:13:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 01:13:10,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-21 01:13:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2022-07-21 01:13:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-07-21 01:13:10,027 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2022-07-21 01:13:10,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:13:10,028 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-07-21 01:13:10,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 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) [2022-07-21 01:13:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-07-21 01:13:10,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 01:13:10,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:13:10,029 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2022-07-21 01:13:10,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 01:13:10,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:13:10,231 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:13:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:13:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 833592518, now seen corresponding path program 4 times [2022-07-21 01:13:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:13:10,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021964828] [2022-07-21 01:13:10,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 01:13:10,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:13:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:13:10,234 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) [2022-07-21 01:13:10,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 01:13:10,518 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 01:13:10,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:13:10,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 01:13:10,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:13:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 44 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 01:13:11,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:13:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 44 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 01:13:12,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:13:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021964828] [2022-07-21 01:13:12,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021964828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:13:12,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:13:12,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-21 01:13:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714835536] [2022-07-21 01:13:12,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:13:12,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 01:13:12,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:13:12,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 01:13:12,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-07-21 01:13:12,407 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2022-07-21 01:13:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:13:13,430 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-07-21 01:13:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 01:13:13,436 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 19 [2022-07-21 01:13:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:13:13,436 INFO L225 Difference]: With dead ends: 20 [2022-07-21 01:13:13,436 INFO L226 Difference]: Without dead ends: 0 [2022-07-21 01:13:13,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-07-21 01:13:13,437 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:13:13,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 01:13:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-21 01:13:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-21 01:13:13,438 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) [2022-07-21 01:13:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-21 01:13:13,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-07-21 01:13:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:13:13,438 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-21 01:13:13,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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) [2022-07-21 01:13:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-21 01:13:13,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-21 01:13:13,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:13:13,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 01:13:13,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:13:13,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.