./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/num_conversion_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/bitvector/num_conversion_1.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:39:17,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:39:17,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:39:17,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:39:17,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:39:17,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:39:17,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:39:17,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:39:17,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:39:17,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:39:17,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:39:17,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:39:17,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:39:17,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:39:17,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:39:17,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:39:17,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:39:17,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:39:17,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:39:17,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:39:17,776 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:39:17,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:39:17,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:39:17,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:39:17,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:39:17,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:39:17,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:39:17,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:39:17,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:39:17,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:39:17,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:39:17,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:39:17,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:39:17,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:39:17,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:39:17,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:39:17,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:39:17,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:39:17,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:39:17,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:39:17,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:39:17,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:39:17,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:39:17,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:39:17,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:39:17,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:39:17,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:39:17,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:39:17,823 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:39:17,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:39:17,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:39:17,824 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:39:17,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:39:17,825 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:39:17,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:39:17,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:39:17,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:39:17,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:39:17,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:39:17,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:39:17,826 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:39:17,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:39:17,827 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:39:17,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:39:17,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:39:17,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:39:17,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:39:17,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:39:17,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:39:17,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:39:17,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:39:17,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:39:17,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:39:17,829 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:39:17,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:39:17,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:39:17,830 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2022-07-11 23:39:18,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:39:18,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:39:18,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:39:18,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:39:18,066 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:39:18,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2022-07-11 23:39:18,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972842735/9950a80a0c604bb39bfb501a0aace117/FLAG5905df066 [2022-07-11 23:39:18,526 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:39:18,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2022-07-11 23:39:18,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972842735/9950a80a0c604bb39bfb501a0aace117/FLAG5905df066 [2022-07-11 23:39:18,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972842735/9950a80a0c604bb39bfb501a0aace117 [2022-07-11 23:39:18,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:39:18,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:39:18,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:39:18,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:39:18,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:39:18,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:39:18" (1/1) ... [2022-07-11 23:39:18,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8598cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:18, skipping insertion in model container [2022-07-11 23:39:18,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:39:18" (1/1) ... [2022-07-11 23:39:18,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:39:18,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:39:19,112 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/bitvector/num_conversion_1.c[673,686] [2022-07-11 23:39:19,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:39:19,130 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:39:19,146 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/bitvector/num_conversion_1.c[673,686] [2022-07-11 23:39:19,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:39:19,160 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:39:19,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19 WrapperNode [2022-07-11 23:39:19,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:39:19,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:39:19,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:39:19,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:39:19,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,174 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,188 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-07-11 23:39:19,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:39:19,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:39:19,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:39:19,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:39:19,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:39:19,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:39:19,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:39:19,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:39:19,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (1/1) ... [2022-07-11 23:39:19,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:39:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:19,244 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-11 23:39:19,245 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-11 23:39:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:39:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:39:19,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:39:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:39:19,317 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:39:19,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:39:19,453 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:39:19,458 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:39:19,458 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:39:19,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:19 BoogieIcfgContainer [2022-07-11 23:39:19,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:39:19,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:39:19,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:39:19,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:39:19,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:39:18" (1/3) ... [2022-07-11 23:39:19,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ebd7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:39:19, skipping insertion in model container [2022-07-11 23:39:19,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:19" (2/3) ... [2022-07-11 23:39:19,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ebd7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:39:19, skipping insertion in model container [2022-07-11 23:39:19,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:19" (3/3) ... [2022-07-11 23:39:19,470 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2022-07-11 23:39:19,482 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:39:19,482 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:39:19,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:39:19,562 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@10bfdd66, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@465a69b1 [2022-07-11 23:39:19,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:39:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-11 23:39:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-11 23:39:19,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:19,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-11 23:39:19,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:19,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:19,582 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-07-11 23:39:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:19,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504906286] [2022-07-11 23:39:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:19,706 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-11 23:39:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:39:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504906286] [2022-07-11 23:39:19,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504906286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:39:19,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:39:19,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:39:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121136060] [2022-07-11 23:39:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:39:19,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:39:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:39:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:39:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:39:19,745 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:19,756 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-11 23:39:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:39:19,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-11 23:39:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:19,764 INFO L225 Difference]: With dead ends: 21 [2022-07-11 23:39:19,764 INFO L226 Difference]: Without dead ends: 9 [2022-07-11 23:39:19,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:39:19,771 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:19,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-11 23:39:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-11 23:39:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) 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-11 23:39:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-11 23:39:19,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-07-11 23:39:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:19,798 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-11 23:39:19,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-07-11 23:39:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-11 23:39:19,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:19,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-11 23:39:19,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:39:19,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-07-11 23:39:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:19,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428692277] [2022-07-11 23:39:19,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:19,888 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-11 23:39:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:39:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428692277] [2022-07-11 23:39:19,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428692277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:39:19,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:39:19,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:39:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221759575] [2022-07-11 23:39:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:39:19,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:39:19,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:39:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:39:19,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:39:19,907 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:19,918 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-11 23:39:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:39:19,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-11 23:39:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:19,919 INFO L225 Difference]: With dead ends: 16 [2022-07-11 23:39:19,919 INFO L226 Difference]: Without dead ends: 12 [2022-07-11 23:39:19,919 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-11 23:39:19,921 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:19,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-11 23:39:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-07-11 23:39:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11 23:39:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-11 23:39:19,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-07-11 23:39:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:19,931 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-11 23:39:19,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-07-11 23:39:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-11 23:39:19,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:19,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:19,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:39:19,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-07-11 23:39:19,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:19,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672432034] [2022-07-11 23:39:19,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:20,009 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-11 23:39:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:39:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672432034] [2022-07-11 23:39:20,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672432034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:39:20,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405401944] [2022-07-11 23:39:20,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:39:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:20,012 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-11 23:39:20,014 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-11 23:39:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:39:20,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:20,112 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-11 23:39:20,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:20,158 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-11 23:39:20,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405401944] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:20,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:39:20,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2022-07-11 23:39:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754325200] [2022-07-11 23:39:20,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:20,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:39:20,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:39:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:39:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:39:20,165 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-11 23:39:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:20,213 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-07-11 23:39:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:39:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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) Word has length 9 [2022-07-11 23:39:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:20,215 INFO L225 Difference]: With dead ends: 23 [2022-07-11 23:39:20,216 INFO L226 Difference]: Without dead ends: 19 [2022-07-11 23:39:20,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:39:20,220 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:20,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 29 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-11 23:39:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-11 23:39:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-11 23:39:20,229 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-07-11 23:39:20,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:20,230 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-11 23:39:20,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 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-11 23:39:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-11 23:39:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-11 23:39:20,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:20,231 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:20,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:39:20,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:39:20,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-07-11 23:39:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:20,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758873329] [2022-07-11 23:39:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:39:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758873329] [2022-07-11 23:39:20,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758873329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:39:20,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460242298] [2022-07-11 23:39:20,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:39:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:39:20,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:20,627 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-11 23:39:20,628 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-11 23:39:20,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:39:20,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:20,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-11 23:39:20,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:20,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460242298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:20,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:39:20,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2022-07-11 23:39:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143422262] [2022-07-11 23:39:20,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:20,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:39:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:39:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:39:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:39:20,959 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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-11 23:39:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:21,283 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-07-11 23:39:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:39:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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 18 [2022-07-11 23:39:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:21,284 INFO L225 Difference]: With dead ends: 41 [2022-07-11 23:39:21,284 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:39:21,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2022-07-11 23:39:21,286 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:21,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 96 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:39:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:39:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-11 23:39:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 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-11 23:39:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-07-11 23:39:21,294 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2022-07-11 23:39:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:21,294 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-07-11 23:39:21,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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-11 23:39:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-07-11 23:39:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:39:21,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:21,296 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:21,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 23:39:21,519 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,SelfDestructingSolverStorable3 [2022-07-11 23:39:21,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2022-07-11 23:39:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:39:21,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273275431] [2022-07-11 23:39:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:39:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:39:21,657 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:39:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:39:21,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:39:21,749 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:39:21,752 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:39:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:39:21,757 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-07-11 23:39:21,760 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:39:21,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:39:21 BoogieIcfgContainer [2022-07-11 23:39:21,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:39:21,805 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:39:21,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:39:21,806 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:39:21,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:19" (3/4) ... [2022-07-11 23:39:21,808 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:39:21,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:39:21,809 INFO L158 Benchmark]: Toolchain (without parser) took 2855.92ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 59.0MB in the beginning and 93.4MB in the end (delta: -34.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:21,810 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:21,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.23ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 92.7MB in the end (delta: -33.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:39:21,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.63ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:39:21,811 INFO L158 Benchmark]: Boogie Preprocessor took 16.74ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 90.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:21,815 INFO L158 Benchmark]: RCFGBuilder took 253.42ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 81.3MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:39:21,817 INFO L158 Benchmark]: TraceAbstraction took 2343.35ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 93.4MB in the end (delta: -12.8MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2022-07-11 23:39:21,817 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 117.4MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:21,821 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.22ms. Allocated memory is still 90.2MB. Free memory was 49.1MB in the beginning and 49.0MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.23ms. Allocated memory was 90.2MB in the beginning and 117.4MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 92.7MB in the end (delta: -33.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.63ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 91.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 16.74ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 90.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 253.42ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 81.3MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2343.35ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 93.4MB in the end (delta: -12.8MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 117.4MB. Free memory is still 93.4MB. 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=0, i=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=0, i=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=1, i=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=1, i=254, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=1, i=254, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=2, i=254, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=2, i=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=2, i=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=3, i=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=3, i=4, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=3, i=4, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=4, i=4, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=4, i=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=4, i=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=5, i=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=5, i=6, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=5, i=6, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=6, i=6, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=6, i=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=6, i=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=7, i=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=7, i=0, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=7, i=0, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=8, i=0, x=37, y=0] [L31] COND FALSE !(c < (unsigned char)8) VAL [bit=0, c=8, i=0, x=37, y=0] [L39] CALL __VERIFIER_assert(x == y) [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 47 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 26, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 606 SizeOfPredicates, 6 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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-11 23:39:21,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/bitvector/num_conversion_1.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 bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:39:23,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:39:23,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:39:23,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:39:23,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:39:23,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:39:23,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:39:23,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:39:23,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:39:23,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:39:23,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:39:23,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:39:23,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:39:23,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:39:23,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:39:23,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:39:23,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:39:23,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:39:23,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:39:23,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:39:23,840 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:39:23,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:39:23,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:39:23,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:39:23,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:39:23,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:39:23,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:39:23,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:39:23,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:39:23,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:39:23,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:39:23,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:39:23,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:39:23,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:39:23,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:39:23,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:39:23,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:39:23,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:39:23,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:39:23,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:39:23,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:39:23,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:39:23,870 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:39:23,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:39:23,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:39:23,902 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:39:23,902 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:39:23,903 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:39:23,903 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:39:23,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:39:23,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:39:23,904 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:39:23,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:39:23,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:39:23,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:39:23,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:39:23,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:39:23,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:39:23,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:39:23,906 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:39:23,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:39:23,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:39:23,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:39:23,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:39:23,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:39:23,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:39:23,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:39:23,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:39:23,909 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:39:23,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:39:23,910 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:39:23,910 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:39:23,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:39:23,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:39:23,910 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 -> bdb7543d1c240ce49edc036e26416805e34b577c5ba56fd044d3b26828ca42a8 [2022-07-11 23:39:24,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:39:24,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:39:24,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:39:24,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:39:24,285 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:39:24,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2022-07-11 23:39:24,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e65225a/a7f4f2924277478b9ea1724534cf2959/FLAGaa9bba34a [2022-07-11 23:39:24,734 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:39:24,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2022-07-11 23:39:24,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e65225a/a7f4f2924277478b9ea1724534cf2959/FLAGaa9bba34a [2022-07-11 23:39:24,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e65225a/a7f4f2924277478b9ea1724534cf2959 [2022-07-11 23:39:24,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:39:24,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:39:24,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:39:24,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:39:24,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:39:24,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:24,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d874acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24, skipping insertion in model container [2022-07-11 23:39:24,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:24,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:39:24,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:39:24,923 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/bitvector/num_conversion_1.c[673,686] [2022-07-11 23:39:24,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:39:24,954 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:39:24,972 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/bitvector/num_conversion_1.c[673,686] [2022-07-11 23:39:24,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:39:24,990 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:39:24,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24 WrapperNode [2022-07-11 23:39:24,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:39:24,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:39:24,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:39:24,992 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:39:25,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,022 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-07-11 23:39:25,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:39:25,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:39:25,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:39:25,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:39:25,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:39:25,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:39:25,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:39:25,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:39:25,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (1/1) ... [2022-07-11 23:39:25,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:39:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:39:25,093 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-11 23:39:25,118 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-11 23:39:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:39:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:39:25,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:39:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:39:25,188 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:39:25,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:39:25,289 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:39:25,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:39:25,294 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:39:25,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:25 BoogieIcfgContainer [2022-07-11 23:39:25,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:39:25,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:39:25,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:39:25,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:39:25,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:39:24" (1/3) ... [2022-07-11 23:39:25,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684663cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:39:25, skipping insertion in model container [2022-07-11 23:39:25,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:39:24" (2/3) ... [2022-07-11 23:39:25,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684663cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:39:25, skipping insertion in model container [2022-07-11 23:39:25,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:25" (3/3) ... [2022-07-11 23:39:25,303 INFO L111 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2022-07-11 23:39:25,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:39:25,315 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:39:25,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:39:25,376 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@5b2a5b41, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67b24580 [2022-07-11 23:39:25,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:39:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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-11 23:39:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-11 23:39:25,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:25,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-11 23:39:25,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-07-11 23:39:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:25,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084215348] [2022-07-11 23:39:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:25,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:25,447 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-11 23:39:25,449 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-11 23:39:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:25,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-11 23:39:25,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:25,515 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-11 23:39:25,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:39:25,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:25,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084215348] [2022-07-11 23:39:25,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084215348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:39:25,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:39:25,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:39:25,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802103582] [2022-07-11 23:39:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:39:25,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:39:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:25,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:39:25,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:39:25,546 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:25,557 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-07-11 23:39:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:39:25,559 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-11 23:39:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:25,565 INFO L225 Difference]: With dead ends: 21 [2022-07-11 23:39:25,565 INFO L226 Difference]: Without dead ends: 9 [2022-07-11 23:39:25,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:39:25,574 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:25,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-11 23:39:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-11 23:39:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) 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-11 23:39:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-11 23:39:25,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-07-11 23:39:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:25,603 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-11 23:39:25,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-07-11 23:39:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-11 23:39:25,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:25,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-11 23:39:25,615 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-11 23:39:25,811 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-11 23:39:25,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-07-11 23:39:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454268076] [2022-07-11 23:39:25,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:25,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:25,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:25,815 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-11 23:39:25,816 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-11 23:39:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:25,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:39:25,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:25,876 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-11 23:39:25,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:39:25,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:25,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454268076] [2022-07-11 23:39:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454268076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:39:25,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:39:25,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:39:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028146782] [2022-07-11 23:39:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:39:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:39:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:39:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:39:25,881 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:25,897 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-07-11 23:39:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:39:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-11 23:39:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:25,898 INFO L225 Difference]: With dead ends: 16 [2022-07-11 23:39:25,899 INFO L226 Difference]: Without dead ends: 12 [2022-07-11 23:39:25,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:39:25,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:25,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-11 23:39:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-07-11 23:39:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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-11 23:39:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-11 23:39:25,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-07-11 23:39:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:25,904 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-11 23:39:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-07-11 23:39:25,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-11 23:39:25,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:25,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:25,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-11 23:39:26,105 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-11 23:39:26,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-07-11 23:39:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:26,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896474969] [2022-07-11 23:39:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:26,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:26,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:26,111 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-11 23:39:26,114 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-11 23:39:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:26,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:39:26,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:26,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:39:26,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:26,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896474969] [2022-07-11 23:39:26,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896474969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:39:26,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:39:26,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:39:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196935772] [2022-07-11 23:39:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:39:26,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:39:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:26,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:39:26,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:39:26,191 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-11 23:39:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:26,223 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-11 23:39:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:39:26,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 9 [2022-07-11 23:39:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:26,224 INFO L225 Difference]: With dead ends: 24 [2022-07-11 23:39:26,224 INFO L226 Difference]: Without dead ends: 17 [2022-07-11 23:39:26,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:39:26,226 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:26,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-11 23:39:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2022-07-11 23:39:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-11 23:39:26,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2022-07-11 23:39:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:26,229 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-11 23:39:26,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-11 23:39:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-07-11 23:39:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-11 23:39:26,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:26,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:26,241 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-11 23:39:26,435 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-11 23:39:26,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2022-07-11 23:39:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:26,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549565675] [2022-07-11 23:39:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:26,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:26,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:26,439 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-11 23:39:26,442 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-11 23:39:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:26,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:39:26,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:26,485 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-11 23:39:26,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:26,521 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-11 23:39:26,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549565675] [2022-07-11 23:39:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549565675] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:26,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-11 23:39:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125043274] [2022-07-11 23:39:26,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:39:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:39:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:39:26,524 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:26,568 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-07-11 23:39:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:39:26,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-11 23:39:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:26,570 INFO L225 Difference]: With dead ends: 23 [2022-07-11 23:39:26,570 INFO L226 Difference]: Without dead ends: 19 [2022-07-11 23:39:26,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-11 23:39:26,571 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:26,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-11 23:39:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-11 23:39:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-11 23:39:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-11 23:39:26,580 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2022-07-11 23:39:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:26,581 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-11 23:39:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:39:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-11 23:39:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-11 23:39:26,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:26,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:26,594 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-11 23:39:26,790 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-11 23:39:26,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:26,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2022-07-11 23:39:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:26,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137971502] [2022-07-11 23:39:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:39:26,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:26,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:26,794 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-11 23:39:26,796 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-11 23:39:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:39:26,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:39:26,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:39:26,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:39:26,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:26,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137971502] [2022-07-11 23:39:26,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137971502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:26,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-11 23:39:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113125959] [2022-07-11 23:39:26,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:39:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:39:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:39:26,983 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-11 23:39:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:27,174 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-07-11 23:39:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:39:27,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 18 [2022-07-11 23:39:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:27,176 INFO L225 Difference]: With dead ends: 56 [2022-07-11 23:39:27,176 INFO L226 Difference]: Without dead ends: 47 [2022-07-11 23:39:27,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:39:27,177 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:27,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:39:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-11 23:39:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2022-07-11 23:39:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-11 23:39:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-07-11 23:39:27,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-07-11 23:39:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:27,184 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-07-11 23:39:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-11 23:39:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-07-11 23:39:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-11 23:39:27,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:27,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:27,195 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-11 23:39:27,386 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-11 23:39:27,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2022-07-11 23:39:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924380301] [2022-07-11 23:39:27,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:39:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:27,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:39:27,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:39:27,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:39:27,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:27,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:39:27,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:27,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:27,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924380301] [2022-07-11 23:39:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924380301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:27,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:27,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-11 23:39:27,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660493133] [2022-07-11 23:39:27,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:27,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:39:27,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:27,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:39:27,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:39:27,547 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-11 23:39:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:27,638 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-07-11 23:39:27,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:39:27,640 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 18 [2022-07-11 23:39:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:27,642 INFO L225 Difference]: With dead ends: 35 [2022-07-11 23:39:27,642 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 23:39:27,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:39:27,646 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:27,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 68 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:39:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 23:39:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-11 23:39:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-11 23:39:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-11 23:39:27,660 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2022-07-11 23:39:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-11 23:39:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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-11 23:39:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-11 23:39:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:39:27,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:27,664 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:27,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:39:27,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:39:27,876 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2022-07-11 23:39:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:27,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643929129] [2022-07-11 23:39:27,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:39:27,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:27,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:27,879 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:39:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 23:39:27,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-11 23:39:27,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:27,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-11 23:39:27,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:39:28,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:39:29,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:29,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643929129] [2022-07-11 23:39:29,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643929129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:29,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:29,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-07-11 23:39:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373283581] [2022-07-11 23:39:29,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-11 23:39:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-11 23:39:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2022-07-11 23:39:29,711 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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-11 23:39:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:30,166 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-11 23:39:30,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-11 23:39:30,169 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 30 [2022-07-11 23:39:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:30,170 INFO L225 Difference]: With dead ends: 64 [2022-07-11 23:39:30,170 INFO L226 Difference]: Without dead ends: 60 [2022-07-11 23:39:30,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2022-07-11 23:39:30,171 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:30,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 233 Unchecked, 0.0s Time] [2022-07-11 23:39:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-11 23:39:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2022-07-11 23:39:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 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-11 23:39:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-07-11 23:39:30,178 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2022-07-11 23:39:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:30,179 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-07-11 23:39:30,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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-11 23:39:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-07-11 23:39:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:39:30,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:30,180 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:30,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:39:30,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:39:30,389 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:30,389 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2022-07-11 23:39:30,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:30,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107025135] [2022-07-11 23:39:30,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:39:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:30,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:30,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:39:30,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 23:39:30,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:39:30,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:30,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:39:30,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:30,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:30,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:30,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107025135] [2022-07-11 23:39:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107025135] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:30,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:30,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-11 23:39:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276785315] [2022-07-11 23:39:30,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:30,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:39:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:30,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:39:30,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:39:30,825 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-11 23:39:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:31,465 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-07-11 23:39:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-11 23:39:31,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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 30 [2022-07-11 23:39:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:31,467 INFO L225 Difference]: With dead ends: 111 [2022-07-11 23:39:31,467 INFO L226 Difference]: Without dead ends: 87 [2022-07-11 23:39:31,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2022-07-11 23:39:31,468 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 209 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:31,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 64 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:39:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-11 23:39:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2022-07-11 23:39:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 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-11 23:39:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-11 23:39:31,484 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2022-07-11 23:39:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:31,485 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-11 23:39:31,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 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-11 23:39:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-11 23:39:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:39:31,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:39:31,487 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2022-07-11 23:39:31,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:39:31,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:39:31,696 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:39:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:39:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2022-07-11 23:39:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:39:31,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889982618] [2022-07-11 23:39:31,697 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:39:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:39:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:39:31,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:39:31,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 23:39:31,740 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-11 23:39:31,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:39:31,741 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-11 23:39:31,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:39:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:33,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:39:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:39:35,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:39:35,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889982618] [2022-07-11 23:39:35,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889982618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:39:35,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:39:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-07-11 23:39:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313276990] [2022-07-11 23:39:35,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:39:35,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-11 23:39:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:39:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-11 23:39:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2022-07-11 23:39:35,607 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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-11 23:39:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:39:36,916 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-07-11 23:39:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:39:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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 33 [2022-07-11 23:39:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:39:36,917 INFO L225 Difference]: With dead ends: 56 [2022-07-11 23:39:36,917 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:39:36,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=855, Invalid=3435, Unknown=0, NotChecked=0, Total=4290 [2022-07-11 23:39:36,920 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:39:36,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 13 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-07-11 23:39:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:39:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:39:36,921 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-11 23:39:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:39:36,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-07-11 23:39:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:39:36,921 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:39:36,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 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-11 23:39:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:39:36,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:39:36,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:39:36,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-11 23:39:37,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:39:37,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:39:37,745 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:39:37,746 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse2 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|)) (.cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse0 (= |ULTIMATE.start_main_~bit~0#1| (_ bv0 8))) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse1 .cse2) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|) (_ bv0 32))) .cse1 .cse2) (and (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse1) (and .cse3 .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse6))))) (let ((.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse4))) .cse5))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse6))) .cse5))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse7))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7))) .cse5))) (_ bv0 32)) (bvslt .cse7 (_ bv8 32))))))) .cse1) (and .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv5 8)) .cse0 .cse1) (and .cse3 (= (_ bv4 8) |ULTIMATE.start_main_~bit~0#1|) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse8 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (and (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse8))) ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse8)))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse11))))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse9))) .cse10))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse11))) .cse10))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))) (bvslt .cse12 (_ bv8 32))))))) .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8)) (|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse17))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse19))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32))))))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32))))) (.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13))) .cse14))) (_ bv0 32)) (bvslt .cse15 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse16))) .cse14)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse17))) .cse14))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) .cse14)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse18))) .cse14))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse15 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19))) .cse14))) (_ bv0 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse20))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))) (bvslt .cse21 (_ bv8 32)))))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse22))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse22 (_ bv1 32))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse27))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse28))))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|)) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse23))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) .cse25))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse26))) .cse25)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))) .cse25))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))) .cse25))) (_ bv0 32)) (bvslt .cse23 (_ bv8 32))))))))) .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse32))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34))))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse31 (_ bv1 32)))))))) (.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29))) .cse30))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31))) .cse30)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32))) .cse30))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33))) .cse30))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse33 (_ bv1 32)))) (bvslt .cse33 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))) .cse30))) (_ bv0 32))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse35))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 (_ bv1 32)))) (_ bv1 32))))))) .cse1))) [2022-07-11 23:39:37,746 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2022-07-11 23:39:37,746 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-07-11 23:39:37,746 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2022-07-11 23:39:37,747 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-11 23:39:37,747 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2022-07-11 23:39:37,747 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:39:37,747 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:39:37,748 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:39:37,749 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-07-11 23:39:37,749 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-07-11 23:39:37,749 INFO L902 garLoopResultBuilder]: At program point L41(lines 22 42) the Hoare annotation is: true [2022-07-11 23:39:37,752 INFO L356 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2022-07-11 23:39:37,754 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:39:37,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,795 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,796 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,797 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,820 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,820 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,820 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,821 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,822 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,823 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,824 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,825 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,826 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,827 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:39:37 BoogieIcfgContainer [2022-07-11 23:39:37,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:39:37,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:39:37,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:39:37,832 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:39:37,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:39:25" (3/4) ... [2022-07-11 23:39:37,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:39:37,842 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-11 23:39:37,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:39:37,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:39:37,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:39:37,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((y == 5bv8 && c == 5bv8) && bit == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0] && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) [2022-07-11 23:39:37,868 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:39:37,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:39:37,868 INFO L158 Benchmark]: Toolchain (without parser) took 13108.55ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.5MB in the beginning and 40.3MB in the end (delta: -2.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,869 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:37,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.76ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 42.2MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 58.7MB. Free memory was 42.2MB in the beginning and 40.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,869 INFO L158 Benchmark]: Boogie Preprocessor took 38.35ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 39.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:39:37,870 INFO L158 Benchmark]: RCFGBuilder took 234.29ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 31.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,870 INFO L158 Benchmark]: TraceAbstraction took 12533.58ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 43.2MB in the end (delta: -12.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,871 INFO L158 Benchmark]: Witness Printer took 35.79ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 40.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:39:37,872 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.57ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.76ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 42.2MB in the end (delta: -4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 58.7MB. Free memory was 42.2MB in the beginning and 40.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.35ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 39.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.29ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 31.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12533.58ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.6MB in the beginning and 43.2MB in the end (delta: -12.6MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 35.79ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 40.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] * 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 272 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 470 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 80 mSDtfsCounter, 470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 905 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 998 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 46 QuantifiedInterpolants, 7387 SizeOfPredicates, 40 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 182/693 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant [2022-07-11 23:39:37,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,909 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,916 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,917 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,918 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,919 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,920 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2022-07-11 23:39:37,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,921 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,923 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2022-07-11 23:39:37,924 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2022-07-11 23:39:37,925 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] Derived loop invariant: ((((((((((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && x == 37bv8) && 1bv8 == y)) || ((y == 0bv8 && c == 0bv8) && x == 37bv8)) || (((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((y == 5bv8 && c == 5bv8) && bit == 0bv8) && x == 37bv8)) || ((((y == 5bv8 && 4bv8 == bit) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0])) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8, ULTIMATE.start_main_~x~0#1 : bv8 :: ((((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32 && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0])) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(ULTIMATE.start_main_~x~0#1))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: (~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0] && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || (((bit == 0bv8 && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: (((((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32 && 0bv32 == ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0])) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), 1bv32)[7:0]))[7:0]), 8bv32)) && ~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && (\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-11 23:39:37,948 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 Writing output log to file Ultimate.log Result: TRUE