./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 2329fc70 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-?-2329fc7 [2023-02-13 23:12:37,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:12:37,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:12:37,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:12:37,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:12:37,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:12:37,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:12:37,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:12:37,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:12:37,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:12:37,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:12:37,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:12:37,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:12:37,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:12:37,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:12:37,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:12:37,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:12:37,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:12:37,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:12:37,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:12:37,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:12:37,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:12:37,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:12:37,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:12:37,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:12:37,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:12:37,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:12:37,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:12:37,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:12:37,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:12:37,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:12:37,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:12:37,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:12:37,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:12:37,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:12:37,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:12:37,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:12:37,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:12:37,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:12:37,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:12:37,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:12:37,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:12:37,958 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:12:37,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:12:37,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:12:37,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:12:37,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:12:37,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:12:37,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:12:37,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:12:37,960 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:12:37,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:12:37,961 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:12:37,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:12:37,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:37,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:12:37,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:12:37,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:12:37,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:12:37,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:12:37,963 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:12:37,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:12:37,964 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:12:37,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:12:37,964 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:12:37,964 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-13 23:12:38,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:12:38,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:12:38,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:12:38,176 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:12:38,176 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:12:38,177 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-13 23:12:39,149 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:12:39,257 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:12:39,257 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-13 23:12:39,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1e3e1fd/d875a19814754a38a74c408abac7dc27/FLAGba23f748b [2023-02-13 23:12:39,273 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1e3e1fd/d875a19814754a38a74c408abac7dc27 [2023-02-13 23:12:39,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:12:39,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:12:39,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:39,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:12:39,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:12:39,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58665f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39, skipping insertion in model container [2023-02-13 23:12:39,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:12:39,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:12:39,373 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-13 23:12:39,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:39,396 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:12:39,404 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-13 23:12:39,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:39,419 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:12:39,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39 WrapperNode [2023-02-13 23:12:39,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:39,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:39,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:12:39,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:12:39,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,461 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-13 23:12:39,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:39,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:12:39,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:12:39,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:12:39,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:12:39,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:12:39,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:12:39,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:12:39,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (1/1) ... [2023-02-13 23:12:39,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:39,515 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-13 23:12:39,534 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-13 23:12:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:12:39,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:12:39,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:12:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:12:39,586 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:12:39,588 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:12:39,701 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:12:39,705 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:12:39,705 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 23:12:39,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:39 BoogieIcfgContainer [2023-02-13 23:12:39,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:12:39,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:12:39,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:12:39,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:12:39,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:12:39" (1/3) ... [2023-02-13 23:12:39,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1084e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:39, skipping insertion in model container [2023-02-13 23:12:39,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:39" (2/3) ... [2023-02-13 23:12:39,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1084e27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:39, skipping insertion in model container [2023-02-13 23:12:39,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:39" (3/3) ... [2023-02-13 23:12:39,714 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-13 23:12:39,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:12:39,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:12:39,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:12:39,771 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;@431d319c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:12:39,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:12:39,774 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-13 23:12:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:12:39,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:39,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:12:39,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-13 23:12:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:39,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538432698] [2023-02-13 23:12:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:39,870 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-13 23:12:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538432698] [2023-02-13 23:12:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538432698] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:39,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 23:12:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773269721] [2023-02-13 23:12:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:39,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:12:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:12:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:12:39,907 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-13 23:12:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:39,916 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-13 23:12:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:12:39,918 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-13 23:12:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:39,923 INFO L225 Difference]: With dead ends: 21 [2023-02-13 23:12:39,923 INFO L226 Difference]: Without dead ends: 9 [2023-02-13 23:12:39,926 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-13 23:12:39,929 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-13 23:12:39,929 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-13 23:12:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-13 23:12:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-13 23:12:39,958 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-13 23:12:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-13 23:12:39,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-13 23:12:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:39,969 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-13 23:12:39,969 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-13 23:12:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-13 23:12:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:12:39,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:39,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:12:39,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:12:39,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-13 23:12:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:39,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612658843] [2023-02-13 23:12:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:39,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:40,021 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-13 23:12:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612658843] [2023-02-13 23:12:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612658843] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:40,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:40,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:12:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711926133] [2023-02-13 23:12:40,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:40,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:12:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:40,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:12:40,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:12:40,025 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-13 23:12:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:40,044 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-13 23:12:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:12:40,044 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-13 23:12:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:40,045 INFO L225 Difference]: With dead ends: 16 [2023-02-13 23:12:40,045 INFO L226 Difference]: Without dead ends: 12 [2023-02-13 23:12:40,045 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-13 23:12:40,046 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-13 23:12:40,047 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-13 23:12:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-13 23:12:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-13 23:12:40,049 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-13 23:12:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-13 23:12:40,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-13 23:12:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:40,050 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-13 23:12:40,050 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-13 23:12:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-13 23:12:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-13 23:12:40,050 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:40,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:40,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:12:40,051 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-13 23:12:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:40,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29996758] [2023-02-13 23:12:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:40,197 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-13 23:12:40,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:40,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29996758] [2023-02-13 23:12:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29996758] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:12:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183925063] [2023-02-13 23:12:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:40,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:40,201 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-13 23:12:40,202 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-13 23:12:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:40,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 23:12:40,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:40,287 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-13 23:12:40,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:40,331 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-13 23:12:40,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183925063] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:40,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:12:40,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 8 [2023-02-13 23:12:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190294939] [2023-02-13 23:12:40,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-13 23:12:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-13 23:12:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-13 23:12:40,333 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-13 23:12:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:40,365 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2023-02-13 23:12:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-13 23:12:40,366 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-13 23:12:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:40,367 INFO L225 Difference]: With dead ends: 23 [2023-02-13 23:12:40,367 INFO L226 Difference]: Without dead ends: 19 [2023-02-13 23:12:40,367 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-13 23:12:40,373 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-13 23:12:40,373 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-13 23:12:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-13 23:12:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-13 23:12:40,377 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-13 23:12:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-13 23:12:40,378 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2023-02-13 23:12:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:40,380 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-13 23:12:40,381 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-13 23:12:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-13 23:12:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:12:40,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:40,382 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:40,390 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-13 23:12:40,588 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-13 23:12:40,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:40,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2023-02-13 23:12:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:40,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519066258] [2023-02-13 23:12:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:40,826 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-13 23:12:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:12:40,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519066258] [2023-02-13 23:12:40,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519066258] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:12:40,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725374073] [2023-02-13 23:12:40,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:12:40,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:12:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:40,858 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-13 23:12:40,884 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-13 23:12:40,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:12:40,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:40,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 23:12:40,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:40,979 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-13 23:12:40,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:41,123 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-13 23:12:41,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725374073] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:41,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:12:41,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2023-02-13 23:12:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419051760] [2023-02-13 23:12:41,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:41,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-13 23:12:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:12:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-13 23:12:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-02-13 23:12:41,127 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-13 23:12:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:41,387 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2023-02-13 23:12:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-13 23:12:41,388 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-13 23:12:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:41,388 INFO L225 Difference]: With dead ends: 41 [2023-02-13 23:12:41,388 INFO L226 Difference]: Without dead ends: 37 [2023-02-13 23:12:41,389 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-13 23:12:41,390 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 23:12:41,390 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-13 23:12:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-13 23:12:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-13 23:12:41,398 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-13 23:12:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-02-13 23:12:41,400 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 18 [2023-02-13 23:12:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:41,400 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-02-13 23:12:41,401 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-13 23:12:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-02-13 23:12:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-13 23:12:41,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:41,402 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:41,411 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-13 23:12:41,606 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-13 23:12:41,607 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1720528430, now seen corresponding path program 3 times [2023-02-13 23:12:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:12:41,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117540378] [2023-02-13 23:12:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:12:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 23:12:41,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-13 23:12:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-13 23:12:41,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-13 23:12:41,701 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-13 23:12:41,703 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-13 23:12:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-13 23:12:41,706 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2023-02-13 23:12:41,708 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-13 23:12:41,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 11:12:41 BoogieIcfgContainer [2023-02-13 23:12:41,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 23:12:41,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-13 23:12:41,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-13 23:12:41,749 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-13 23:12:41,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:39" (3/4) ... [2023-02-13 23:12:41,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-13 23:12:41,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-13 23:12:41,752 INFO L158 Benchmark]: Toolchain (without parser) took 2476.04ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 87.8MB in the beginning and 102.3MB in the end (delta: -14.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2023-02-13 23:12:41,753 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:12:41,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.09ms. Allocated memory is still 127.9MB. Free memory was 87.5MB in the beginning and 77.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-13 23:12:41,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.62ms. Allocated memory is still 127.9MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:12:41,756 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 127.9MB. Free memory was 75.6MB in the beginning and 74.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:12:41,756 INFO L158 Benchmark]: RCFGBuilder took 213.29ms. Allocated memory is still 127.9MB. Free memory was 74.3MB in the beginning and 65.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-13 23:12:41,757 INFO L158 Benchmark]: TraceAbstraction took 2039.02ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 64.4MB in the beginning and 103.3MB in the end (delta: -38.9MB). Peak memory consumption was 503.9kB. Max. memory is 16.1GB. [2023-02-13 23:12:41,757 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:12:41,758 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.14ms. Allocated memory is still 127.9MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 143.09ms. Allocated memory is still 127.9MB. Free memory was 87.5MB in the beginning and 77.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.62ms. Allocated memory is still 127.9MB. Free memory was 77.6MB in the beginning and 75.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 127.9MB. Free memory was 75.6MB in the beginning and 74.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 213.29ms. Allocated memory is still 127.9MB. Free memory was 74.3MB in the beginning and 65.1MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2039.02ms. Allocated memory was 127.9MB in the beginning and 165.7MB in the end (delta: 37.7MB). Free memory was 64.4MB in the beginning and 103.3MB in the end (delta: -38.9MB). Peak memory consumption was 503.9kB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 32, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L24] unsigned char x; [L25] unsigned char y; [L26] unsigned char c; [L28] x = 37 [L29] y = 0 [L30] c = 0 VAL [c=0, x=37, y=0] [L31] COND TRUE c < (unsigned char)8 [L32] unsigned char i = ((unsigned char)1) << c; [L33] unsigned char bit = x & i; VAL [bit=0, c=0, i=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: 2.0s, 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.2s SatisfiabilityAnalysisTime, 0.6s 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-13 23:12:41,779 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-?-2329fc7 [2023-02-13 23:12:43,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:12:43,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:12:43,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:12:43,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:12:43,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:12:43,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:12:43,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:12:43,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:12:43,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:12:43,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:12:43,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:12:43,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:12:43,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:12:43,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:12:43,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:12:43,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:12:43,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:12:43,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:12:43,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:12:43,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:12:43,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:12:43,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:12:43,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:12:43,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:12:43,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:12:43,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:12:43,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:12:43,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:12:43,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:12:43,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:12:43,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:12:43,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:12:43,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:12:43,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:12:43,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:12:43,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:12:43,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:12:43,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:12:43,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:12:43,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:12:43,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-13 23:12:43,639 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:12:43,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:12:43,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:12:43,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:12:43,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:12:43,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:12:43,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:12:43,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:12:43,641 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:12:43,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:12:43,642 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:12:43,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:12:43,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:12:43,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:12:43,644 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:12:43,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:12:43,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:12:43,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:12:43,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:12:43,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:43,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:12:43,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:12:43,646 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:12:43,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:12:43,646 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-13 23:12:43,651 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:12:43,651 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-13 23:12:43,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:12:43,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:12:43,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:12:43,894 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:12:43,895 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:12:43,896 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-13 23:12:44,967 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:12:45,114 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:12:45,114 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/num_conversion_1.c [2023-02-13 23:12:45,118 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63631382/2e3f7f5b2cd8420698a52a0df2bb9842/FLAG03ab28372 [2023-02-13 23:12:45,130 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63631382/2e3f7f5b2cd8420698a52a0df2bb9842 [2023-02-13 23:12:45,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:12:45,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:12:45,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:45,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:12:45,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:12:45,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60022088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45, skipping insertion in model container [2023-02-13 23:12:45,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:12:45,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:12:45,256 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-13 23:12:45,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:45,280 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:12:45,287 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-13 23:12:45,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:12:45,304 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:12:45,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45 WrapperNode [2023-02-13 23:12:45,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:12:45,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:45,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:12:45,306 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:12:45,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,327 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2023-02-13 23:12:45,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:12:45,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:12:45,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:12:45,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:12:45,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:12:45,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:12:45,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:12:45,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:12:45,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (1/1) ... [2023-02-13 23:12:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:12:45,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:12:45,386 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-13 23:12:45,419 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-13 23:12:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:12:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:12:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:12:45,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-13 23:12:45,479 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:12:45,480 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:12:45,605 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:12:45,609 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:12:45,611 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 23:12:45,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:45 BoogieIcfgContainer [2023-02-13 23:12:45,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:12:45,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:12:45,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:12:45,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:12:45,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:12:45" (1/3) ... [2023-02-13 23:12:45,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66296c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:45, skipping insertion in model container [2023-02-13 23:12:45,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:12:45" (2/3) ... [2023-02-13 23:12:45,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66296c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:12:45, skipping insertion in model container [2023-02-13 23:12:45,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:45" (3/3) ... [2023-02-13 23:12:45,618 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.c [2023-02-13 23:12:45,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:12:45,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:12:45,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:12:45,678 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;@38513b9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:12:45,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:12:45,680 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-13 23:12:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:12:45,684 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:45,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:12:45,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2023-02-13 23:12:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:45,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657176632] [2023-02-13 23:12:45,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:45,696 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-13 23:12:45,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:45,698 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-13 23:12:45,699 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-13 23:12:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:45,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-13 23:12:45,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:45,794 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-13 23:12:45,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:12:45,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:45,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657176632] [2023-02-13 23:12:45,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657176632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:45,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:45,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 23:12:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154427198] [2023-02-13 23:12:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:45,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:12:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:12:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:12:45,835 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-13 23:12:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:45,862 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-02-13 23:12:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:12:45,864 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-13 23:12:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:45,869 INFO L225 Difference]: With dead ends: 21 [2023-02-13 23:12:45,869 INFO L226 Difference]: Without dead ends: 9 [2023-02-13 23:12:45,872 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-13 23:12:45,876 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-13 23:12:45,877 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-13 23:12:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-02-13 23:12:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-02-13 23:12:45,895 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-13 23:12:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2023-02-13 23:12:45,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2023-02-13 23:12:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:45,896 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2023-02-13 23:12:45,897 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-13 23:12:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2023-02-13 23:12:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:12:45,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:45,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:12:45,904 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 (2)] Ended with exit code 0 [2023-02-13 23:12:46,104 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-13 23:12:46,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2023-02-13 23:12:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:46,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176148682] [2023-02-13 23:12:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:46,106 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-13 23:12:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:46,107 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-13 23:12:46,120 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-13 23:12:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:46,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-13 23:12:46,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:46,176 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-13 23:12:46,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:12:46,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:46,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176148682] [2023-02-13 23:12:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176148682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:46,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:46,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:12:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012046333] [2023-02-13 23:12:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:46,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:12:46,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:12:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:12:46,179 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-13 23:12:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:46,186 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-02-13 23:12:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:12:46,187 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-13 23:12:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:46,187 INFO L225 Difference]: With dead ends: 16 [2023-02-13 23:12:46,187 INFO L226 Difference]: Without dead ends: 12 [2023-02-13 23:12:46,188 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-13 23:12:46,188 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-13 23:12:46,189 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-13 23:12:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-02-13 23:12:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2023-02-13 23:12:46,191 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-13 23:12:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-13 23:12:46,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-13 23:12:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:46,192 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-13 23:12:46,192 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-13 23:12:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-13 23:12:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-13 23:12:46,193 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:46,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:46,217 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-13 23:12:46,418 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-13 23:12:46,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2023-02-13 23:12:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:46,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036821453] [2023-02-13 23:12:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:46,420 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-13 23:12:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:46,422 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-13 23:12:46,423 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-13 23:12:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:46,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 23:12:46,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:46,501 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-13 23:12:46,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-13 23:12:46,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:46,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036821453] [2023-02-13 23:12:46,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036821453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:12:46,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:12:46,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-13 23:12:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972893166] [2023-02-13 23:12:46,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:12:46,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-13 23:12:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:46,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-13 23:12:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-13 23:12:46,504 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-13 23:12:46,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:46,544 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-02-13 23:12:46,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-13 23:12:46,544 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-13 23:12:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:46,545 INFO L225 Difference]: With dead ends: 24 [2023-02-13 23:12:46,545 INFO L226 Difference]: Without dead ends: 17 [2023-02-13 23:12:46,546 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-13 23:12:46,547 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-13 23:12:46,547 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-13 23:12:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-13 23:12:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-13 23:12:46,551 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-13 23:12:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-13 23:12:46,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-02-13 23:12:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:46,552 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-13 23:12:46,552 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-13 23:12:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-13 23:12:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-13 23:12:46,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:46,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:46,564 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 (4)] Forceful destruction successful, exit code 0 [2023-02-13 23:12:46,761 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-13 23:12:46,761 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:46,762 INFO L85 PathProgramCache]: Analyzing trace with hash 584467323, now seen corresponding path program 1 times [2023-02-13 23:12:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920339387] [2023-02-13 23:12:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:46,763 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-13 23:12:46,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:46,764 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-13 23:12:46,766 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-13 23:12:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:46,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-13 23:12:46,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:46,798 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-13 23:12:46,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:46,817 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-13 23:12:46,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:46,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920339387] [2023-02-13 23:12:46,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920339387] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:46,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:46,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-13 23:12:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366900932] [2023-02-13 23:12:46,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:46,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-13 23:12:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-13 23:12:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-13 23:12:46,824 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-13 23:12:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:46,848 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-13 23:12:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:12:46,848 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-13 23:12:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:46,848 INFO L225 Difference]: With dead ends: 23 [2023-02-13 23:12:46,849 INFO L226 Difference]: Without dead ends: 19 [2023-02-13 23:12:46,849 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-13 23:12:46,850 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-13 23:12:46,850 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-13 23:12:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-13 23:12:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-13 23:12:46,853 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-13 23:12:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-02-13 23:12:46,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-02-13 23:12:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:46,854 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-02-13 23:12:46,854 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-13 23:12:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-02-13 23:12:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:12:46,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:46,855 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:46,875 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 (5)] Forceful destruction successful, exit code 0 [2023-02-13 23:12:47,073 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-13 23:12:47,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1843204080, now seen corresponding path program 1 times [2023-02-13 23:12:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:47,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764514280] [2023-02-13 23:12:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:12:47,077 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-13 23:12:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:47,078 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-13 23:12:47,081 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-13 23:12:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:12:47,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-13 23:12:47,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:47,157 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-13 23:12:47,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:47,215 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-13 23:12:47,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:47,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764514280] [2023-02-13 23:12:47,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764514280] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:47,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:47,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-13 23:12:47,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304680292] [2023-02-13 23:12:47,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:47,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-13 23:12:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:47,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-13 23:12:47,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-13 23:12:47,217 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-13 23:12:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:47,374 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-02-13 23:12:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-13 23:12:47,375 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-13 23:12:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:47,376 INFO L225 Difference]: With dead ends: 56 [2023-02-13 23:12:47,376 INFO L226 Difference]: Without dead ends: 47 [2023-02-13 23:12:47,376 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-13 23:12:47,377 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-13 23:12:47,377 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-13 23:12:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-13 23:12:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2023-02-13 23:12:47,381 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-13 23:12:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2023-02-13 23:12:47,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2023-02-13 23:12:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:47,382 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2023-02-13 23:12:47,383 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-13 23:12:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2023-02-13 23:12:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:12:47,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:47,383 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:47,403 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-13 23:12:47,590 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-13 23:12:47,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1771704846, now seen corresponding path program 2 times [2023-02-13 23:12:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:47,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043168996] [2023-02-13 23:12:47,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:12:47,591 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-13 23:12:47,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:47,592 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-13 23:12:47,595 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-13 23:12:47,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:12:47,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:47,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-13 23:12:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:47,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-13 23:12:47,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:47,764 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-13 23:12:47,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043168996] [2023-02-13 23:12:47,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043168996] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:47,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-13 23:12:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721813635] [2023-02-13 23:12:47,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:47,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-13 23:12:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-13 23:12:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-02-13 23:12:47,766 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-13 23:12:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:47,835 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-02-13 23:12:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-13 23:12:47,836 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-13 23:12:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:47,836 INFO L225 Difference]: With dead ends: 35 [2023-02-13 23:12:47,836 INFO L226 Difference]: Without dead ends: 31 [2023-02-13 23:12:47,836 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-13 23:12:47,837 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-13 23:12:47,837 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-13 23:12:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-13 23:12:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-13 23:12:47,841 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-13 23:12:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-02-13 23:12:47,841 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2023-02-13 23:12:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:47,841 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-02-13 23:12:47,841 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-13 23:12:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-02-13 23:12:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-13 23:12:47,842 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:47,842 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:47,861 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-13 23:12:48,049 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-13 23:12:48,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash -29656432, now seen corresponding path program 3 times [2023-02-13 23:12:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:48,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256784475] [2023-02-13 23:12:48,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-13 23:12:48,050 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-13 23:12:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:48,051 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-13 23:12:48,057 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-13 23:12:48,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-02-13 23:12:48,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:48,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-13 23:12:48,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:48,557 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-13 23:12:48,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:49,708 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-13 23:12:49,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:49,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256784475] [2023-02-13 23:12:49,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256784475] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:49,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:49,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2023-02-13 23:12:49,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110486553] [2023-02-13 23:12:49,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:49,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-13 23:12:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-13 23:12:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2023-02-13 23:12:49,714 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-13 23:12:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:51,227 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-02-13 23:12:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-13 23:12:51,227 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-13 23:12:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:51,228 INFO L225 Difference]: With dead ends: 75 [2023-02-13 23:12:51,228 INFO L226 Difference]: Without dead ends: 71 [2023-02-13 23:12:51,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=379, Invalid=2171, Unknown=0, NotChecked=0, Total=2550 [2023-02-13 23:12:51,230 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-13 23:12:51,230 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-13 23:12:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-13 23:12:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2023-02-13 23:12:51,236 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-13 23:12:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-02-13 23:12:51,236 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 30 [2023-02-13 23:12:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:51,237 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-02-13 23:12:51,237 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-13 23:12:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-02-13 23:12:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-13 23:12:51,238 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:51,238 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:51,248 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-13 23:12:51,444 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-13 23:12:51,445 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:51,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash -86914734, now seen corresponding path program 4 times [2023-02-13 23:12:51,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:51,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128191611] [2023-02-13 23:12:51,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-13 23:12:51,446 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-13 23:12:51,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:51,447 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-13 23:12:51,449 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-13 23:12:51,471 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-13 23:12:51,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:51,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-13 23:12:51,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:51,604 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-13 23:12:51,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:51,812 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-13 23:12:51,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:51,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128191611] [2023-02-13 23:12:51,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128191611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:51,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:51,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-13 23:12:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37704568] [2023-02-13 23:12:51,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:51,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-13 23:12:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:51,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-13 23:12:51,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-13 23:12:51,813 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-13 23:12:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:52,354 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-13 23:12:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-13 23:12:52,355 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-13 23:12:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:52,356 INFO L225 Difference]: With dead ends: 111 [2023-02-13 23:12:52,356 INFO L226 Difference]: Without dead ends: 87 [2023-02-13 23:12:52,357 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-13 23:12:52,357 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.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:12:52,357 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.2s Time] [2023-02-13 23:12:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-13 23:12:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 56. [2023-02-13 23:12:52,366 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-13 23:12:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2023-02-13 23:12:52,366 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 30 [2023-02-13 23:12:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:52,367 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2023-02-13 23:12:52,367 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-13 23:12:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2023-02-13 23:12:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-13 23:12:52,367 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:12:52,367 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1] [2023-02-13 23:12:52,375 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 (9)] Ended with exit code 0 [2023-02-13 23:12:52,574 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-13 23:12:52,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:12:52,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:12:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1430216517, now seen corresponding path program 5 times [2023-02-13 23:12:52,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-13 23:12:52,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773061875] [2023-02-13 23:12:52,575 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-13 23:12:52,575 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-13 23:12:52,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-13 23:12:52,576 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-13 23:12:52,578 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-13 23:12:52,599 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-02-13 23:12:52,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:12:52,600 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-13 23:12:52,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:12:54,010 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-13 23:12:54,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:12:56,170 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-13 23:12:56,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-13 23:12:56,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773061875] [2023-02-13 23:12:56,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773061875] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:12:56,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-13 23:12:56,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2023-02-13 23:12:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890424425] [2023-02-13 23:12:56,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-13 23:12:56,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-13 23:12:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-13 23:12:56,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-13 23:12:56,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1624, Unknown=0, NotChecked=0, Total=2070 [2023-02-13 23:12:56,173 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-13 23:12:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:12:58,276 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2023-02-13 23:12:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-13 23:12:58,277 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-13 23:12:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:12:58,277 INFO L225 Difference]: With dead ends: 56 [2023-02-13 23:12:58,277 INFO L226 Difference]: Without dead ends: 0 [2023-02-13 23:12:58,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=955, Invalid=3737, Unknown=0, NotChecked=0, Total=4692 [2023-02-13 23:12:58,278 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-13 23:12:58,278 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-13 23:12:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-13 23:12:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-13 23:12:58,279 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-13 23:12:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-13 23:12:58,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-02-13 23:12:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:12:58,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-13 23:12:58,279 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-13 23:12:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-13 23:12:58,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-13 23:12:58,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-13 23:12:58,292 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-13 23:12:58,482 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-13 23:12:58,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-13 23:12:59,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L895 garLoopResultBuilder]: At program point L31-2(lines 31 38) the Hoare annotation is: (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~x~0#1|))) (let ((.cse1 (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~bit~0#1|) (_ bv0 32)))) (.cse10 (= (_ bv1 8) |ULTIMATE.start_main_~y~0#1|)) (.cse11 (= |ULTIMATE.start_main_~y~0#1| (_ bv5 8))) (.cse12 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse33))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse32 (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse32))) .cse4))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse33))) .cse4))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse34 (_ bv1 32)))) (bvslt .cse34 (_ bv8 32)))))))) (.cse9 (= |ULTIMATE.start_main_~bit~0#1| (_ bv0 8))) (.cse8 (= |ULTIMATE.start_main_~x~0#1| (_ bv37 8)))) (or (and (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse0 ((_ 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) .cse0))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse0 (_ bv1 32))))))) .cse1 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse6))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse7))))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (and (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse2))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse3))) .cse4))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse5))) .cse4)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse6))) .cse4))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse7))) .cse4))) (_ bv0 32)) (bvslt .cse2 (_ bv8 32))))))))) .cse8) (and .cse9 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 8)) .cse8 .cse10) (and (= (_ bv1 8) |ULTIMATE.start_main_~c~0#1|) .cse1 .cse8 .cse10) (and .cse11 .cse9 .cse12 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) ((_ zero_extend 24) |ULTIMATE.start_main_~c~0#1|)))) .cse4))) (_ bv0 32))) .cse8) (and (= |ULTIMATE.start_main_~y~0#1| (_ bv0 8)) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 8)) .cse8) (and .cse11 .cse9 (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 ((.cse13 ((_ 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 .cse13 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse13))) .cse4))) (_ bv0 32)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse14))) .cse4))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse15))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) .cse4))) (_ bv0 32)) (bvslt .cse15 (_ bv8 32))))))) .cse8) (and .cse11 (= (_ bv4 8) |ULTIMATE.start_main_~bit~0#1|) (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse16 ((_ 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) .cse16))) .cse4))) (_ bv0 32))) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd (_ bv1 32) .cse16)))))) .cse12 .cse8) (and .cse9 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8)) (|ULTIMATE.start_main_~x~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse21))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse23))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32))))))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32))))) (.cse18 ((_ 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) .cse17))) .cse18))) (_ bv0 32)) (bvslt .cse19 (_ bv8 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse20))) .cse18)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse21))) .cse18))) (_ bv0 32))) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse19))) .cse18)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse22))) .cse18))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse23))) .cse18))) (_ bv0 32)))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_29|))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse24 (_ bv1 32)))) (_ bv1 32)))))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) (_ bv5 32))) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))) (bvslt .cse25 (_ bv8 32)))))) .cse8) (and .cse9 (exists ((|v_ULTIMATE.start_main_~c~0#1_58| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |v_ULTIMATE.start_main_~c~0#1_58|))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse28))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))) (_ bv1 32)))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) .cse30))))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 (_ bv1 32))))))))) (and (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse26))) .cse4))) (_ bv0 32)) (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse27))) .cse4)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse28))) .cse4))) (_ bv0 32))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse29))) .cse4))) (_ bv0 32)) (= |ULTIMATE.start_main_~c~0#1| ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))) (bvslt .cse29 (_ bv8 32)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse30))) .cse4))) (_ bv0 32))))))))) (exists ((|v_ULTIMATE.start_main_~c~0#1_29| (_ BitVec 8))) (let ((.cse31 ((_ 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) .cse31))) (_ 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 .cse31 (_ bv1 32)))) (_ bv1 32))))))) .cse8)))) [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point L31-3(lines 31 38) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: true [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 22 42) the Hoare annotation is: true [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-13 23:12:59,056 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-13 23:12:59,057 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2023-02-13 23:12:59,057 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-02-13 23:12:59,061 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-02-13 23:12:59,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-13 23:12:59,085 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,085 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,086 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,087 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,088 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,089 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,090 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,091 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,092 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,093 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,101 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,102 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,103 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,104 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,107 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,108 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,109 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.02 11:12:59 BoogieIcfgContainer [2023-02-13 23:12:59,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-13 23:12:59,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-13 23:12:59,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-13 23:12:59,112 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-13 23:12:59,113 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:12:45" (3/4) ... [2023-02-13 23:12:59,115 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-13 23:12:59,121 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-13 23:12:59,121 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-13 23:12:59,122 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-13 23:12:59,122 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-13 23:12:59,142 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\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]) && !(~zero_extendFrom8To32(bit) == 0bv32)) && (\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))) && x == 37bv8) || (((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y)) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && 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)) || ((((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) [2023-02-13 23:12:59,147 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-13 23:12:59,148 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-13 23:12:59,148 INFO L158 Benchmark]: Toolchain (without parser) took 14014.36ms. Allocated memory was 67.1MB in the beginning and 157.3MB in the end (delta: 90.2MB). Free memory was 33.2MB in the beginning and 95.2MB in the end (delta: -61.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,148 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:12:59,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.22ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 33.1MB in the beginning and 59.6MB in the end (delta: -26.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,149 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.16ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,149 INFO L158 Benchmark]: Boogie Preprocessor took 23.44ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 56.9MB in the end (delta: 967.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-13 23:12:59,149 INFO L158 Benchmark]: RCFGBuilder took 259.95ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 47.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,150 INFO L158 Benchmark]: TraceAbstraction took 13498.23ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 46.8MB in the beginning and 98.3MB in the end (delta: -51.5MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,150 INFO L158 Benchmark]: Witness Printer took 35.59ms. Allocated memory is still 157.3MB. Free memory was 98.3MB in the beginning and 95.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-13 23:12:59,152 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.14ms. Allocated memory is still 67.1MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.22ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 33.1MB in the beginning and 59.6MB in the end (delta: -26.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.16ms. Allocated memory is still 88.1MB. Free memory was 59.6MB in the beginning and 57.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.44ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 56.9MB in the end (delta: 967.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.95ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 47.4MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13498.23ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 46.8MB in the beginning and 98.3MB in the end (delta: -51.5MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * Witness Printer took 35.59ms. Allocated memory is still 157.3MB. Free memory was 98.3MB in the beginning and 95.2MB 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_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_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_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_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.4s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, 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.1s 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.4s 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, 981 HoareAnnotationTreeSize, 3 FomulaSimplifications, 71 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1066 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 159 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 282 ConstructedInterpolants, 46 QuantifiedInterpolants, 7387 SizeOfPredicates, 40 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 182/693 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant [2023-02-13 23:12:59,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,174 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~x~0#1,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_58,QUANTIFIED] [2023-02-13 23:12:59,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~c~0#1_29,QUANTIFIED] [2023-02-13 23:12:59,196 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: (((((((((((\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]) && !(~zero_extendFrom8To32(bit) == 0bv32)) && (\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))) && x == 37bv8) || (((bit == 0bv8 && c == 2bv8) && x == 37bv8) && 1bv8 == y)) || (((1bv8 == c && !(~zero_extendFrom8To32(bit) == 0bv32)) && 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)) || ((((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) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-13 23:12:59,211 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