./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 7e1ff0e6 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-?-7e1ff0e [2023-02-14 22:30:49,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:30:49,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:30:49,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:30:49,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:30:49,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:30:49,864 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:30:49,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:30:49,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:30:49,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:30:49,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:30:49,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:30:49,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:30:49,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:30:49,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:30:49,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:30:49,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:30:49,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:30:49,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:30:49,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:30:49,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:30:49,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:30:49,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:30:49,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:30:49,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:30:49,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:30:49,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:30:49,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:30:49,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:30:49,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:30:49,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:30:49,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:30:49,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:30:49,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:30:49,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:30:49,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:30:49,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:30:49,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:30:49,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:30:49,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:30:49,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:30:49,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:30:49,922 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:30:49,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:30:49,923 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:30:49,923 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:30:49,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:30:49,924 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:30:49,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:30:49,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:30:49,924 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:30:49,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:30:49,925 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:30:49,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:30:49,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:30:49,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:30:49,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:30:49,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:30:49,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:30:49,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:30:49,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:30:49,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:30:49,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:30:49,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:30:49,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:30:49,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:30:49,929 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:30:49,929 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-14 22:30:50,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:30:50,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:30:50,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:30:50,124 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:30:50,125 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:30:50,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-14 22:30:50,992 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:30:51,157 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:30:51,158 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-14 22:30:51,162 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e67db1/85cafc7d24c842cfba999af5d420bd07/FLAG0ca3d525f [2023-02-14 22:30:51,172 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0e67db1/85cafc7d24c842cfba999af5d420bd07 [2023-02-14 22:30:51,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:30:51,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:30:51,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:30:51,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:30:51,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:30:51,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755df0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51, skipping insertion in model container [2023-02-14 22:30:51,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,184 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:30:51,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:30:51,299 WARN L237 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] [2023-02-14 22:30:51,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:30:51,311 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:30:51,318 WARN L237 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] [2023-02-14 22:30:51,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:30:51,329 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:30:51,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51 WrapperNode [2023-02-14 22:30:51,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:30:51,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:30:51,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:30:51,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:30:51,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,347 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-14 22:30:51,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:30:51,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:30:51,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:30:51,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:30:51,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:30:51,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:30:51,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:30:51,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:30:51,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (1/1) ... [2023-02-14 22:30:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:30:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:30:51,383 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) [2023-02-14 22:30:51,389 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 [2023-02-14 22:30:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:30:51,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:30:51,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:30:51,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:30:51,451 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:30:51,455 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:30:51,579 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:30:51,583 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:30:51,592 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 22:30:51,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:51 BoogieIcfgContainer [2023-02-14 22:30:51,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:30:51,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:30:51,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:30:51,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:30:51,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:30:51" (1/3) ... [2023-02-14 22:30:51,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6237065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:30:51, skipping insertion in model container [2023-02-14 22:30:51,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:51" (2/3) ... [2023-02-14 22:30:51,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6237065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:30:51, skipping insertion in model container [2023-02-14 22:30:51,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:51" (3/3) ... [2023-02-14 22:30:51,599 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-14 22:30:51,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:30:51,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:30:51,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:30:51,653 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f3dff72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:30:51,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:30:51,656 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) [2023-02-14 22:30:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 22:30:51,659 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:51,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 22:30:51,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-14 22:30:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:30:51,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639967745] [2023-02-14 22:30:51,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:30:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:30:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639967745] [2023-02-14 22:30:51,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639967745] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:30:51,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:30:51,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:30:51,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526813572] [2023-02-14 22:30:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:30:51,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:30:51,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:30:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:30:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:30:51,803 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) [2023-02-14 22:30:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:51,812 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-14 22:30:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:30:51,813 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 [2023-02-14 22:30:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:51,819 INFO L225 Difference]: With dead ends: 21 [2023-02-14 22:30:51,819 INFO L226 Difference]: Without dead ends: 9 [2023-02-14 22:30:51,821 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 [2023-02-14 22:30:51,823 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 [2023-02-14 22:30:51,824 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] [2023-02-14 22:30:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-14 22:30:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-14 22:30:51,841 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) [2023-02-14 22:30:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-14 22:30:51,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-14 22:30:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:51,843 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-14 22:30:51,843 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) [2023-02-14 22:30:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-14 22:30:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 22:30:51,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:51,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 22:30:51,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:30:51,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-14 22:30:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:30:51,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118419532] [2023-02-14 22:30:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:30:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:30:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118419532] [2023-02-14 22:30:51,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118419532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:30:51,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:30:51,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 22:30:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809921249] [2023-02-14 22:30:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:30:51,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 22:30:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:30:51,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 22:30:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 22:30:51,958 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) [2023-02-14 22:30:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:51,966 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-14 22:30:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 22:30:51,967 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 [2023-02-14 22:30:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:51,967 INFO L225 Difference]: With dead ends: 16 [2023-02-14 22:30:51,967 INFO L226 Difference]: Without dead ends: 12 [2023-02-14 22:30:51,968 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 [2023-02-14 22:30:51,969 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 [2023-02-14 22:30:51,969 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] [2023-02-14 22:30:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-14 22:30:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-14 22:30:51,971 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) [2023-02-14 22:30:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-14 22:30:51,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-14 22:30:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:51,972 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-14 22:30:51,972 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) [2023-02-14 22:30:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-14 22:30:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 22:30:51,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:51,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:51,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:30:51,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-14 22:30:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:30:51,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118370968] [2023-02-14 22:30:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:30:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:30:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118370968] [2023-02-14 22:30:52,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118370968] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:30:52,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782952501] [2023-02-14 22:30:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:30:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:30:52,129 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) [2023-02-14 22:30:52,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 22:30:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:52,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:30:52,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:30:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782952501] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:30:52,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:30:52,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2023-02-14 22:30:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098988105] [2023-02-14 22:30:52,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:30:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 22:30:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:30:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 22:30:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-14 22:30:52,276 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) [2023-02-14 22:30:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:52,316 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2023-02-14 22:30:52,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 22:30:52,317 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 [2023-02-14 22:30:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:52,318 INFO L225 Difference]: With dead ends: 23 [2023-02-14 22:30:52,318 INFO L226 Difference]: Without dead ends: 19 [2023-02-14 22:30:52,319 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 [2023-02-14 22:30:52,320 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 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 [2023-02-14 22:30:52,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:30:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-14 22:30:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-14 22:30:52,323 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) [2023-02-14 22:30:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-14 22:30:52,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2023-02-14 22:30:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-14 22:30:52,324 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) [2023-02-14 22:30:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-14 22:30:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 22:30:52,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:52,324 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:52,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:52,525 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 [2023-02-14 22:30:52,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2023-02-14 22:30:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:30:52,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905497678] [2023-02-14 22:30:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:30:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:30:52,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905497678] [2023-02-14 22:30:52,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905497678] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:30:52,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061188822] [2023-02-14 22:30:52,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:30:52,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:30:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:30:52,694 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) [2023-02-14 22:30:52,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 22:30:52,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:30:52,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:30:52,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 22:30:52,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:30:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:52,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061188822] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:30:52,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:30:52,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2023-02-14 22:30:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611847466] [2023-02-14 22:30:52,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:30:52,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:30:52,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:30:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:30:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:30:52,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) [2023-02-14 22:30:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:53,235 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-02-14 22:30:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 22:30:53,235 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 [2023-02-14 22:30:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:53,236 INFO L225 Difference]: With dead ends: 41 [2023-02-14 22:30:53,236 INFO L226 Difference]: Without dead ends: 37 [2023-02-14 22:30:53,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2023-02-14 22:30:53,237 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:30:53,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 96 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:30:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-14 22:30:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-14 22:30:53,241 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) [2023-02-14 22:30:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-02-14 22:30:53,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2023-02-14 22:30:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:53,242 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-02-14 22:30:53,243 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) [2023-02-14 22:30:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-02-14 22:30:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 22:30:53,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:53,243 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:53,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:53,448 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 [2023-02-14 22:30:53,448 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:53,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:53,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2023-02-14 22:30:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:30:53,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207905902] [2023-02-14 22:30:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:30:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:30:53,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 22:30:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 22:30:53,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 22:30:53,518 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 22:30:53,519 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 22:30:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 22:30:53,522 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-02-14 22:30:53,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 22:30:53,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:30:53 BoogieIcfgContainer [2023-02-14 22:30:53,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 22:30:53,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 22:30:53,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 22:30:53,568 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 22:30:53,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:51" (3/4) ... [2023-02-14 22:30:53,571 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-14 22:30:53,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 22:30:53,571 INFO L158 Benchmark]: Toolchain (without parser) took 2396.18ms. Allocated memory is still 138.4MB. Free memory was 107.9MB in the beginning and 85.7MB in the end (delta: 22.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-02-14 22:30:53,571 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:30:53,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.19ms. Allocated memory is still 138.4MB. Free memory was 107.9MB in the beginning and 97.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 22:30:53,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.18ms. Allocated memory is still 138.4MB. Free memory was 97.3MB in the beginning and 95.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:30:53,576 INFO L158 Benchmark]: Boogie Preprocessor took 11.18ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 94.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:30:53,576 INFO L158 Benchmark]: RCFGBuilder took 234.53ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 85.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 22:30:53,576 INFO L158 Benchmark]: TraceAbstraction took 1972.14ms. Allocated memory is still 138.4MB. Free memory was 84.8MB in the beginning and 86.6MB in the end (delta: -1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:30:53,576 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 85.7MB in the end (delta: 941.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:30:53,578 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.13ms. Allocated memory is still 98.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.19ms. Allocated memory is still 138.4MB. Free memory was 107.9MB in the beginning and 97.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.18ms. Allocated memory is still 138.4MB. Free memory was 97.3MB in the beginning and 95.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.18ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 94.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 234.53ms. Allocated memory is still 138.4MB. Free memory was 94.7MB in the beginning and 85.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1972.14ms. Allocated memory is still 138.4MB. Free memory was 84.8MB in the beginning and 86.6MB in the end (delta: -1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 138.4MB. Free memory was 86.6MB in the beginning and 85.7MB in the end (delta: 941.2kB). Peak memory consumption was 2.1MB. 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=0, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=1, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=1, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=2, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=2, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=3, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=3, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=4, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=4, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=5, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=5, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=6, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=6, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=7, i=1, 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=1, x=37, y=0] [L34] COND FALSE !(bit != (unsigned char)0) VAL [bit=0, c=7, i=1, x=37, y=0] [L37] c = c + ((unsigned char)1) VAL [bit=0, c=8, i=1, x=37, y=0] [L31] COND FALSE !(c < (unsigned char)8) VAL [bit=0, c=8, i=1, 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: 1.9s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 153 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 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.4s 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 5 NumberOfNonLiveVariables, 113 ConjunctsInSsa, 22 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 [2023-02-14 22:30:53,589 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-?-7e1ff0e [2023-02-14 22:30:55,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:30:55,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:30:55,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:30:55,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:30:55,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:30:55,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:30:55,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:30:55,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:30:55,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:30:55,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:30:55,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:30:55,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:30:55,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:30:55,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:30:55,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:30:55,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:30:55,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:30:55,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:30:55,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:30:55,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:30:55,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:30:55,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:30:55,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:30:55,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:30:55,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:30:55,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:30:55,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:30:55,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:30:55,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:30:55,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:30:55,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:30:55,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:30:55,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:30:55,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:30:55,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:30:55,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:30:55,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:30:55,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:30:55,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:30:55,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:30:55,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-14 22:30:55,416 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:30:55,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:30:55,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:30:55,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:30:55,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:30:55,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:30:55,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:30:55,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:30:55,419 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:30:55,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:30:55,419 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 22:30:55,420 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 22:30:55,421 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 22:30:55,421 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:30:55,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:30:55,421 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:30:55,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:30:55,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:30:55,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:30:55,422 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:30:55,423 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 22:30:55,424 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:30:55,424 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-14 22:30:55,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:30:55,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:30:55,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:30:55,657 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:30:55,659 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:30:55,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-14 22:30:56,564 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:30:56,715 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:30:56,716 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-14 22:30:56,729 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71df2d39/3a4ea9b407fe4cca8d1bae76d587f6a0/FLAGcb7c787e2 [2023-02-14 22:30:56,738 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b71df2d39/3a4ea9b407fe4cca8d1bae76d587f6a0 [2023-02-14 22:30:56,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:30:56,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:30:56,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:30:56,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:30:56,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:30:56,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7720ae45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56, skipping insertion in model container [2023-02-14 22:30:56,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:30:56,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:30:56,897 WARN L237 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] [2023-02-14 22:30:56,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:30:56,913 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:30:56,923 WARN L237 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] [2023-02-14 22:30:56,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:30:56,935 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:30:56,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56 WrapperNode [2023-02-14 22:30:56,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:30:56,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:30:56,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:30:56,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:30:56,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,957 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-14 22:30:56,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:30:56,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:30:56,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:30:56,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:30:56,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,988 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:56,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:30:56,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:30:56,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:30:56,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:30:56,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (1/1) ... [2023-02-14 22:30:57,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:30:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:30:57,022 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) [2023-02-14 22:30:57,039 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 [2023-02-14 22:30:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:30:57,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:30:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:30:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 22:30:57,097 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:30:57,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:30:57,230 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:30:57,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:30:57,233 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 22:30:57,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:57 BoogieIcfgContainer [2023-02-14 22:30:57,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:30:57,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:30:57,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:30:57,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:30:57,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:30:56" (1/3) ... [2023-02-14 22:30:57,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:30:57, skipping insertion in model container [2023-02-14 22:30:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:30:56" (2/3) ... [2023-02-14 22:30:57,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1729df27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:30:57, skipping insertion in model container [2023-02-14 22:30:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:57" (3/3) ... [2023-02-14 22:30:57,239 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-14 22:30:57,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:30:57,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:30:57,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:30:57,329 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@190f8ae1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:30:57,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:30:57,345 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) [2023-02-14 22:30:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 22:30:57,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:57,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 22:30:57,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-14 22:30:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:57,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937775726] [2023-02-14 22:30:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:57,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:57,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:57,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-14 22:30:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:57,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 22:30:57,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:57,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 22:30:57,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:57,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937775726] [2023-02-14 22:30:57,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937775726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:30:57,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:30:57,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:30:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316874490] [2023-02-14 22:30:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:30:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:30:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:57,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:30:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:30:57,508 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) [2023-02-14 22:30:57,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:57,519 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-14 22:30:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:30:57,520 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 [2023-02-14 22:30:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:57,524 INFO L225 Difference]: With dead ends: 21 [2023-02-14 22:30:57,524 INFO L226 Difference]: Without dead ends: 9 [2023-02-14 22:30:57,527 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 [2023-02-14 22:30:57,530 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 [2023-02-14 22:30:57,531 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] [2023-02-14 22:30:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-14 22:30:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-14 22:30:57,549 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) [2023-02-14 22:30:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-14 22:30:57,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-14 22:30:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:57,550 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-14 22:30:57,550 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) [2023-02-14 22:30:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-14 22:30:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 22:30:57,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:57,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 22:30:57,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:57,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:57,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-14 22:30:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:57,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413183447] [2023-02-14 22:30:57,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:57,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:57,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:57,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:57,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-14 22:30:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:57,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-14 22:30:57,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:57,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 22:30:57,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:57,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413183447] [2023-02-14 22:30:57,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413183447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:30:57,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:30:57,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 22:30:57,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699514409] [2023-02-14 22:30:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:30:57,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 22:30:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 22:30:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 22:30:57,818 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) [2023-02-14 22:30:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:57,838 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-14 22:30:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 22:30:57,838 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 [2023-02-14 22:30:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:57,842 INFO L225 Difference]: With dead ends: 16 [2023-02-14 22:30:57,843 INFO L226 Difference]: Without dead ends: 12 [2023-02-14 22:30:57,843 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 [2023-02-14 22:30:57,844 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 [2023-02-14 22:30:57,844 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] [2023-02-14 22:30:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-14 22:30:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-14 22:30:57,850 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) [2023-02-14 22:30:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-14 22:30:57,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-14 22:30:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:57,850 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-14 22:30:57,850 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) [2023-02-14 22:30:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-14 22:30:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 22:30:57,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:57,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:57,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:58,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-14 22:30:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115491375] [2023-02-14 22:30:58,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:58,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:58,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-14 22:30:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:58,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 22:30:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:58,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 22:30:58,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:58,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115491375] [2023-02-14 22:30:58,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115491375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:30:58,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:30:58,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:30:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197283647] [2023-02-14 22:30:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:30:58,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:30:58,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:30:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:30:58,132 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) [2023-02-14 22:30:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:58,159 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-02-14 22:30:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 22:30:58,160 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 [2023-02-14 22:30:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:58,161 INFO L225 Difference]: With dead ends: 24 [2023-02-14 22:30:58,161 INFO L226 Difference]: Without dead ends: 17 [2023-02-14 22:30:58,161 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 [2023-02-14 22:30:58,163 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:30:58,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:30:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-14 22:30:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-14 22:30:58,166 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) [2023-02-14 22:30:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-14 22:30:58,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-02-14 22:30:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:58,167 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-14 22:30:58,167 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) [2023-02-14 22:30:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-14 22:30:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-14 22:30:58,167 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:58,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:58,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-14 22:30:58,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2023-02-14 22:30:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:58,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183070840] [2023-02-14 22:30:58,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:58,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:58,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:58,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-14 22:30:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:58,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 22:30:58,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:58,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:30:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:58,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:58,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183070840] [2023-02-14 22:30:58,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183070840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:30:58,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:30:58,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-14 22:30:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403639671] [2023-02-14 22:30:58,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:30:58,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 22:30:58,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:58,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 22:30:58,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-14 22:30:58,440 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) [2023-02-14 22:30:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:58,474 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-14 22:30:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 22:30:58,475 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 [2023-02-14 22:30:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:58,476 INFO L225 Difference]: With dead ends: 23 [2023-02-14 22:30:58,476 INFO L226 Difference]: Without dead ends: 19 [2023-02-14 22:30:58,476 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 [2023-02-14 22:30:58,477 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:30:58,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:30:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-14 22:30:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-14 22:30:58,480 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) [2023-02-14 22:30:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-02-14 22:30:58,480 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-02-14 22:30:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-02-14 22:30:58,480 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) [2023-02-14 22:30:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-02-14 22:30:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 22:30:58,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:58,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:58,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-14 22:30:58,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2023-02-14 22:30:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:58,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754311479] [2023-02-14 22:30:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:30:58,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:58,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:58,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-14 22:30:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:30:58,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 22:30:58,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 22:30:58,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:30:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 22:30:58,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:58,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754311479] [2023-02-14 22:30:58,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754311479] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:30:58,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:30:58,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-14 22:30:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899110391] [2023-02-14 22:30:58,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:30:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 22:30:58,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 22:30:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-14 22:30:58,864 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) [2023-02-14 22:30:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:59,028 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-02-14 22:30:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-14 22:30:59,028 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 [2023-02-14 22:30:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:59,029 INFO L225 Difference]: With dead ends: 56 [2023-02-14 22:30:59,029 INFO L226 Difference]: Without dead ends: 47 [2023-02-14 22:30:59,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-02-14 22:30:59,030 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:30:59,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:30:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-14 22:30:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2023-02-14 22:30:59,034 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) [2023-02-14 22:30:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-14 22:30:59,035 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2023-02-14 22:30:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:59,035 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-14 22:30:59,035 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) [2023-02-14 22:30:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-14 22:30:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 22:30:59,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:59,036 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:59,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:59,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2023-02-14 22:30:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:59,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938668110] [2023-02-14 22:30:59,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:30:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:59,244 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:59,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-14 22:30:59,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:30:59,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:30:59,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:30:59,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:30:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:59,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:30:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:30:59,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:30:59,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938668110] [2023-02-14 22:30:59,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938668110] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:30:59,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:30:59,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-14 22:30:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884968103] [2023-02-14 22:30:59,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:30:59,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 22:30:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:30:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 22:30:59,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-14 22:30:59,379 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) [2023-02-14 22:30:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:30:59,437 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-02-14 22:30:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 22:30:59,437 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 [2023-02-14 22:30:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:30:59,438 INFO L225 Difference]: With dead ends: 35 [2023-02-14 22:30:59,438 INFO L226 Difference]: Without dead ends: 31 [2023-02-14 22:30:59,438 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 [2023-02-14 22:30:59,439 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:30:59,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 68 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:30:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-14 22:30:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-14 22:30:59,443 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) [2023-02-14 22:30:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-14 22:30:59,443 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2023-02-14 22:30:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:30:59,443 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-14 22:30:59,444 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) [2023-02-14 22:30:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-14 22:30:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 22:30:59,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:30:59,444 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2023-02-14 22:30:59,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-14 22:30:59,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:59,653 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:30:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:30:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2023-02-14 22:30:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:30:59,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124851232] [2023-02-14 22:30:59,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:30:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:30:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:30:59,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:30:59,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 22:30:59,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-14 22:30:59,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:30:59,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 22:30:59,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:31:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 22:31:00,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:31:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 22:31:01,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:31:01,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124851232] [2023-02-14 22:31:01,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124851232] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:31:01,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:31:01,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-02-14 22:31:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074647809] [2023-02-14 22:31:01,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:31:01,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-14 22:31:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:31:01,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-14 22:31:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2023-02-14 22:31:01,155 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) [2023-02-14 22:31:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:31:02,568 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-02-14 22:31:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-14 22:31:02,569 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 [2023-02-14 22:31:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:31:02,571 INFO L225 Difference]: With dead ends: 75 [2023-02-14 22:31:02,571 INFO L226 Difference]: Without dead ends: 71 [2023-02-14 22:31:02,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2023-02-14 22:31:02,575 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 22:31:02,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 149 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 22:31:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-14 22:31:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2023-02-14 22:31:02,582 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) [2023-02-14 22:31:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-14 22:31:02,583 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2023-02-14 22:31:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:31:02,583 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-14 22:31:02,584 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) [2023-02-14 22:31:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-14 22:31:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-14 22:31:02,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:31:02,584 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-14 22:31:02,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-14 22:31:02,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:31:02,791 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:31:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:31:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2023-02-14 22:31:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:31:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145349838] [2023-02-14 22:31:02,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:31:02,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:31:02,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:31:02,793 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:31:02,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-14 22:31:02,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:31:02,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:31:02,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:31:02,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:31:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:31:02,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:31:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:31:03,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:31:03,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145349838] [2023-02-14 22:31:03,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145349838] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:31:03,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:31:03,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-14 22:31:03,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777182285] [2023-02-14 22:31:03,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:31:03,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 22:31:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:31:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 22:31:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-14 22:31:03,133 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) [2023-02-14 22:31:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:31:03,666 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-14 22:31:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 22:31:03,667 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 [2023-02-14 22:31:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:31:03,667 INFO L225 Difference]: With dead ends: 111 [2023-02-14 22:31:03,667 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 22:31:03,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 22:31:03,668 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 200 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:31:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 64 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:31:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 22:31:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2023-02-14 22:31:03,676 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) [2023-02-14 22:31:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-02-14 22:31:03,676 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2023-02-14 22:31:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:31:03,677 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-02-14 22:31:03,677 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) [2023-02-14 22:31:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-02-14 22:31:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 22:31:03,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:31:03,678 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2023-02-14 22:31:03,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-14 22:31:03,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:31:03,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:31:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:31:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2023-02-14 22:31:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 22:31:03,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578100735] [2023-02-14 22:31:03,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:31:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:31:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 22:31:03,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-14 22:31:03,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-14 22:31:03,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-14 22:31:03,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:31:03,916 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-14 22:31:03,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:31:05,207 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 37 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:31:05,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:31:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 68 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:31:07,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 22:31:07,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578100735] [2023-02-14 22:31:07,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578100735] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:31:07,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:31:07,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-14 22:31:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330382002] [2023-02-14 22:31:07,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:31:07,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-14 22:31:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 22:31:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-14 22:31:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2023-02-14 22:31:07,339 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) [2023-02-14 22:31:09,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:31:09,429 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-02-14 22:31:09,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-14 22:31:09,429 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 [2023-02-14 22:31:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:31:09,430 INFO L225 Difference]: With dead ends: 56 [2023-02-14 22:31:09,430 INFO L226 Difference]: Without dead ends: 0 [2023-02-14 22:31:09,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=955, Invalid=3737, Unknown=0, NotChecked=0, Total=4692 [2023-02-14 22:31:09,431 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 22:31:09,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 22:31:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-14 22:31:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-14 22:31:09,432 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) [2023-02-14 22:31:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-14 22:31:09,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-02-14 22:31:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:31:09,433 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-14 22:31:09,433 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) [2023-02-14 22:31:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-14 22:31:09,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-14 22:31:09,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 22:31:09,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-14 22:31:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 22:31:09,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-14 22:31:10,285 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-14 22:31:10,287 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~c~0#1|)) (.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse4 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse34 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse34))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33))) .cse6))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse34))) .cse6))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse35 (_ bv1 32)))) (bvslt .cse35 (_ bv8 32)))))))) (.cse0 (= |ULTIMATE.start_main_~bit~0#1| (_ bv0 8))) (.cse16 (or (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))) (_ bv8 32))) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|) (_ bv0 32))))) (.cse1 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8))) (.cse2 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse1 .cse2) (and .cse3 .cse0 .cse4 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse5))) .cse6))) (_ bv0 32))) .cse1) (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 ((.cse8 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse8))))) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7))) .cse6))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse8))) .cse6))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse9))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse9))) .cse6))) (_ bv0 32)) (bvslt .cse9 (_ bv8 32))))))) .cse1) (and (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse10 ((_ 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) .cse10))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse10 (_ bv1 32))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse14))))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse15))))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 (_ bv1 32)))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse11))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse12))) .cse6))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13))) .cse6)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14))) .cse6))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) .cse6))) (_ bv0 32)) (bvslt .cse11 (_ bv8 32))))))))) .cse16 .cse1) (and .cse3 (= (_ bv4 8) |ULTIMATE.start_main_~bit~0#1|) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse17 ((_ 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) .cse17))) .cse6))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse17)))))) .cse4 .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8)) (|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse22))))) (let ((.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse24))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32))))))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32))))) (.cse19 ((_ 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) .cse18))) .cse19))) (_ bv0 32)) (bvslt .cse20 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse21))) .cse19)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse22))) .cse19))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse20))) .cse19)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23))) .cse19))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) .cse19))) (_ bv0 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse25))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))) (bvslt .cse26 (_ bv8 32)))))) .cse1) (and .cse0 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse29))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse31))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32))))))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))) .cse6))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))) .cse6)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29))) .cse6))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse30))) .cse6))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse30 (_ bv1 32)))) (bvslt .cse30 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse31))) .cse6))) (_ bv0 32))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse32 ((_ 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) .cse32))) (_ 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 .cse32 (_ bv1 32)))) (_ bv1 32))))))) .cse1) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) .cse16 .cse1 .cse2)))) [2023-02-14 22:31:10,287 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2023-02-14 22:31:10,287 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-02-14 22:31:10,287 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2023-02-14 22:31:10,287 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-14 22:31:10,287 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 42) the Hoare annotation is: true [2023-02-14 22:31:10,287 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2023-02-14 22:31:10,287 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2023-02-14 22:31:10,288 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-14 22:31:10,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-14 22:31:10,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-02-14 22:31:10,288 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-02-14 22:31:10,290 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-02-14 22:31:10,291 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 22:31:10,311 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,312 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,313 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,314 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,316 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,317 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,321 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 10:31:10 BoogieIcfgContainer [2023-02-14 22:31:10,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 22:31:10,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 22:31:10,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 22:31:10,341 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 22:31:10,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:30:57" (3/4) ... [2023-02-14 22:31:10,343 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-14 22:31:10,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-14 22:31:10,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-14 22:31:10,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-14 22:31:10,350 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-14 22:31:10,373 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y) || ((((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && x == 37bv8)) || ((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(~bvadd128(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 == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || ((((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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))) && (!~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || !(~zero_extendFrom8To32(bit) == 0bv32))) && 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 == ~bvadd128(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(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 :: (~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[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(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 :: ~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8)) || (((1bv8 == c && (!~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || !(~zero_extendFrom8To32(bit) == 0bv32))) && x == 37bv8) && 1bv8 == y) [2023-02-14 22:31:10,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 22:31:10,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 22:31:10,378 INFO L158 Benchmark]: Toolchain (without parser) took 13637.08ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 57.5MB in the beginning and 52.9MB in the end (delta: 4.6MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,379 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:31:10,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.76ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 46.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.42ms. Allocated memory is still 77.6MB. Free memory was 46.7MB in the beginning and 45.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,380 INFO L158 Benchmark]: Boogie Preprocessor took 35.82ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 22:31:10,381 INFO L158 Benchmark]: RCFGBuilder took 239.75ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 55.9MB in the end (delta: -12.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,381 INFO L158 Benchmark]: TraceAbstraction took 13104.45ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.3MB in the beginning and 56.0MB in the end (delta: -774.5kB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,382 INFO L158 Benchmark]: Witness Printer took 37.77ms. Allocated memory is still 94.4MB. Free memory was 56.0MB in the beginning and 52.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 22:31:10,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 34.0MB in the end (delta: 50.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.76ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 46.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.42ms. Allocated memory is still 77.6MB. Free memory was 46.7MB in the beginning and 45.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.82ms. Allocated memory is still 77.6MB. Free memory was 45.1MB in the beginning and 43.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 239.75ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 55.9MB in the end (delta: -12.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13104.45ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 55.3MB in the beginning and 56.0MB in the end (delta: -774.5kB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 37.77ms. Allocated memory is still 94.4MB. Free memory was 56.0MB in the beginning and 52.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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_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[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_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_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[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_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: 13.0s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 336 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1199 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 80 mSDtfsCounter, 1199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1524 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=8, InterpolantAutomatonStates: 123, 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, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 14 NumberOfFragments, 1001 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1117 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 46 QuantifiedInterpolants, 7387 SizeOfPredicates, 41 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 [2023-02-14 22:31:10,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,421 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,422 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,423 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,424 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,425 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,426 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-14 22:31:10,427 WARN L421 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) || ((((y == 5bv8 && bit == 0bv8) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 8bv32))) && !(~zero_extendFrom8To32(~bvand32(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(c))[7:0]), ~zero_extendFrom8To32(x))[7:0]) == 0bv32)) && x == 37bv8)) || ((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(~bvadd128(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 == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && x == 37bv8)) || ((((\exists v_ULTIMATE.start_main_~c~0#1_29 : bv8 :: ~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]) && (\exists v_ULTIMATE.start_main_~c~0#1_58 : bv8 :: ((((c == ~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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))) && (!~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || !(~zero_extendFrom8To32(bit) == 0bv32))) && 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 == ~bvadd128(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(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_58))[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 :: (~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]) && ~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[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(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 == ~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(1bv32, ~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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(~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(~bvadd128(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 :: ~bvadd128(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29))[7:0]), 5bv32)[7:0] == y && c == ~bvadd128(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(v_ULTIMATE.start_main_~c~0#1_29), 1bv32)[7:0]), 1bv32)[7:0])) && x == 37bv8)) || (((1bv8 == c && (!~bvslt32(~zero_extendFrom8To32(~bvadd128(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32) || !(~zero_extendFrom8To32(bit) == 0bv32))) && x == 37bv8) && 1bv8 == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-14 22:31:10,442 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 Writing output log to file Ultimate.log Result: TRUE