./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/interleave_bits.i -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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:44,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:44,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:44,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:44,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:44,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:44,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:44,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:44,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:44,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:44,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:44,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:44,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:44,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:44,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:44,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:44,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:44,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:44,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:44,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:44,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:44,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:44,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:44,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:44,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:44,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:44,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:44,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:44,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:44,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:44,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:44,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:44,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:44,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:44,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:44,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:44,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:44,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:44,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:44,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:44,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:44,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:52:44,956 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:44,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:44,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:44,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:44,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:44,959 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:44,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:44,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:44,961 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:44,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:44,961 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:44,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:44,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:44,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:44,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:44,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:44,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:44,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:44,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:44,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:44,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:44,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:44,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:52:44,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:52:44,972 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:44,972 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:44,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:44,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2021-12-27 21:52:45,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:45,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:45,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:45,229 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:45,231 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:45,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-27 21:52:45,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566995b47/3487db3c2ad743f0b2634647c676dfd1/FLAGf628e074d [2021-12-27 21:52:45,669 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:45,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-27 21:52:45,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566995b47/3487db3c2ad743f0b2634647c676dfd1/FLAGf628e074d [2021-12-27 21:52:45,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566995b47/3487db3c2ad743f0b2634647c676dfd1 [2021-12-27 21:52:45,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:45,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:45,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:45,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:45,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:45,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295bbe94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45, skipping insertion in model container [2021-12-27 21:52:45,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:45,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:45,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-27 21:52:45,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:45,840 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:45,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-27 21:52:45,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:45,864 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:45,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45 WrapperNode [2021-12-27 21:52:45,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:45,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:45,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:45,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:45,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,911 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2021-12-27 21:52:45,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:45,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:45,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:45,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:45,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:45,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:45,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:45,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:45,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (1/1) ... [2021-12-27 21:52:45,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:45,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:45,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:52:46,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:46,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:46,050 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:46,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:46,152 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:46,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:46,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-27 21:52:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:46 BoogieIcfgContainer [2021-12-27 21:52:46,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:46,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:46,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:46,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:46,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:45" (1/3) ... [2021-12-27 21:52:46,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d852177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:46, skipping insertion in model container [2021-12-27 21:52:46,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:45" (2/3) ... [2021-12-27 21:52:46,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d852177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:46, skipping insertion in model container [2021-12-27 21:52:46,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:46" (3/3) ... [2021-12-27 21:52:46,162 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-12-27 21:52:46,165 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:46,165 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:46,204 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:46,210 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:46,211 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-27 21:52:46,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:46,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-27 21:52:46,231 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-27 21:52:46,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:46,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896261081] [2021-12-27 21:52:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:46,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:46,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:46,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896261081] [2021-12-27 21:52:46,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896261081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:46,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:46,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:46,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993155546] [2021-12-27 21:52:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:46,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:46,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:46,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:46,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:46,435 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:46,465 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-27 21:52:46,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:46,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-27 21:52:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:46,476 INFO L225 Difference]: With dead ends: 20 [2021-12-27 21:52:46,477 INFO L226 Difference]: Without dead ends: 8 [2021-12-27 21:52:46,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:46,482 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:46,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-27 21:52:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-27 21:52:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-27 21:52:46,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-27 21:52:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:46,504 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-27 21:52:46,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-27 21:52:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 21:52:46,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:46,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:46,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:52:46,506 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:46,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-27 21:52:46,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668039198] [2021-12-27 21:52:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:46,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:46,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668039198] [2021-12-27 21:52:46,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668039198] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206685531] [2021-12-27 21:52:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:46,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:46,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:46,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:46,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 21:52:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:46,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:52:46,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:46,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:46,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206685531] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:46,740 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:46,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-27 21:52:46,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076830666] [2021-12-27 21:52:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:46,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:52:46,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:52:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:46,744 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:46,775 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-27 21:52:46,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:46,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-27 21:52:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:46,776 INFO L225 Difference]: With dead ends: 15 [2021-12-27 21:52:46,776 INFO L226 Difference]: Without dead ends: 11 [2021-12-27 21:52:46,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:52:46,778 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:46,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-27 21:52:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-27 21:52:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) [2021-12-27 21:52:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-27 21:52:46,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-27 21:52:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:46,788 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-27 21:52:46,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-27 21:52:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-27 21:52:46,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:46,794 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:46,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:47,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:47,014 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-27 21:52:47,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240537033] [2021-12-27 21:52:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:47,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:47,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:47,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240537033] [2021-12-27 21:52:47,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240537033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277324454] [2021-12-27 21:52:47,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:52:47,114 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:47,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:47,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:47,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-27 21:52:47,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:52:47,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:47,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-27 21:52:47,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:47,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:47,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277324454] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:47,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:47,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-27 21:52:47,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525628879] [2021-12-27 21:52:47,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:47,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-27 21:52:47,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-27 21:52:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-12-27 21:52:47,287 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:47,479 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-12-27 21:52:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:52:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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 10 [2021-12-27 21:52:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:47,480 INFO L225 Difference]: With dead ends: 21 [2021-12-27 21:52:47,480 INFO L226 Difference]: Without dead ends: 17 [2021-12-27 21:52:47,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:52:47,481 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:47,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-27 21:52:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-27 21:52:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-12-27 21:52:47,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-12-27 21:52:47,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:47,484 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-12-27 21:52:47,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-12-27 21:52:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:52:47,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:47,484 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:47,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:47,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-27 21:52:47,695 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-12-27 21:52:47,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912581438] [2021-12-27 21:52:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:47,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:47,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:52:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912581438] [2021-12-27 21:52:47,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912581438] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:52:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008077002] [2021-12-27 21:52:47,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:52:47,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:47,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:47,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-27 21:52:47,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-27 21:52:47,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-27 21:52:47,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:47,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-27 21:52:47,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:47,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:48,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008077002] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:48,188 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-27 21:52:48,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-12-27 21:52:48,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686532517] [2021-12-27 21:52:48,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:48,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-27 21:52:48,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:52:48,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-27 21:52:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2021-12-27 21:52:48,189 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:48,563 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-12-27 21:52:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-27 21:52:48,567 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 16 [2021-12-27 21:52:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:48,567 INFO L225 Difference]: With dead ends: 27 [2021-12-27 21:52:48,583 INFO L226 Difference]: Without dead ends: 23 [2021-12-27 21:52:48,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2021-12-27 21:52:48,584 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:48,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-27 21:52:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-27 21:52:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-12-27 21:52:48,593 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 16 [2021-12-27 21:52:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:48,594 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-12-27 21:52:48,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-12-27 21:52:48,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 21:52:48,598 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:48,599 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:48,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:48,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:52:48,816 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:48,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-12-27 21:52:48,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:52:48,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055595301] [2021-12-27 21:52:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:48,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:52:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:48,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-27 21:52:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-27 21:52:48,883 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-27 21:52:48,883 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-27 21:52:48,884 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:52:48,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:52:48,887 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2021-12-27 21:52:48,889 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:52:48,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:52:48 BoogieIcfgContainer [2021-12-27 21:52:48,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:52:48,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:52:48,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:52:48,906 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:52:48,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:46" (3/4) ... [2021-12-27 21:52:48,908 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-27 21:52:48,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:52:48,908 INFO L158 Benchmark]: Toolchain (without parser) took 3220.04ms. Allocated memory was 54.5MB in the beginning and 92.3MB in the end (delta: 37.7MB). Free memory was 31.4MB in the beginning and 40.3MB in the end (delta: -8.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,909 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:48,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.87ms. Allocated memory is still 54.5MB. Free memory was 31.2MB in the beginning and 34.7MB in the end (delta: -3.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.46ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 34.7MB in the beginning and 58.6MB in the end (delta: -23.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,909 INFO L158 Benchmark]: Boogie Preprocessor took 33.09ms. Allocated memory is still 75.5MB. Free memory was 58.6MB in the beginning and 57.7MB in the end (delta: 902.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:52:48,910 INFO L158 Benchmark]: RCFGBuilder took 210.66ms. Allocated memory is still 75.5MB. Free memory was 57.5MB in the beginning and 49.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,910 INFO L158 Benchmark]: TraceAbstraction took 2747.18ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 48.7MB in the beginning and 41.0MB in the end (delta: 7.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,910 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 92.3MB. Free memory was 41.0MB in the beginning and 40.3MB in the end (delta: 739.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-27 21:52:48,911 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.87ms. Allocated memory is still 54.5MB. Free memory was 31.2MB in the beginning and 34.7MB in the end (delta: -3.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.46ms. Allocated memory was 54.5MB in the beginning and 75.5MB in the end (delta: 21.0MB). Free memory was 34.7MB in the beginning and 58.6MB in the end (delta: -23.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.09ms. Allocated memory is still 75.5MB. Free memory was 58.6MB in the beginning and 57.7MB in the end (delta: 902.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 210.66ms. Allocated memory is still 75.5MB. Free memory was 57.5MB in the beginning and 49.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2747.18ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 48.7MB in the beginning and 41.0MB in the end (delta: 7.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 92.3MB. Free memory was 41.0MB in the beginning and 40.3MB in the end (delta: 739.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 64, overapproximation of bitwiseAnd at line 55. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16] [L53] xx = x [L54] yy = y [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 116 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 28 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=4, InterpolantAutomatonStates: 39, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 3 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-27 21:52:48,926 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/interleave_bits.i -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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:52:50,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:52:50,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:52:50,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:52:50,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:52:50,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:52:50,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:52:50,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:52:50,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:52:50,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:52:50,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:52:50,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:52:50,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:52:50,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:52:50,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:52:50,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:52:50,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:52:50,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:52:50,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:52:50,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:52:50,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:52:50,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:52:50,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:52:50,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:52:50,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:52:50,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:52:50,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:52:50,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:52:50,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:52:50,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:52:50,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:52:50,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:52:50,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:52:50,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:52:50,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:52:50,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:52:50,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:52:50,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:52:50,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:52:50,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:52:50,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:52:50,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-27 21:52:50,497 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:52:50,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:52:50,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:52:50,498 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:52:50,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:52:50,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:52:50,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:52:50,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:52:50,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:52:50,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:52:50,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:52:50,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:52:50,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:52:50,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:52:50,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:50,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:52:50,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:52:50,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:52:50,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-27 21:52:50,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-27 21:52:50,509 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:52:50,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:52:50,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:52:50,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-27 21:52:50,510 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2021-12-27 21:52:50,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:52:50,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:52:50,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:52:50,761 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:52:50,762 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:52:50,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-27 21:52:50,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d6ee3d/f5a16ee5f19c4bc098b61d76bd7684d2/FLAG49c818bdb [2021-12-27 21:52:51,184 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:52:51,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2021-12-27 21:52:51,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d6ee3d/f5a16ee5f19c4bc098b61d76bd7684d2/FLAG49c818bdb [2021-12-27 21:52:51,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37d6ee3d/f5a16ee5f19c4bc098b61d76bd7684d2 [2021-12-27 21:52:51,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:52:51,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:52:51,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:51,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:52:51,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:52:51,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff1d704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51, skipping insertion in model container [2021-12-27 21:52:51,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:52:51,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:52:51,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-27 21:52:51,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:51,752 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:52:51,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2021-12-27 21:52:51,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:52:51,814 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:52:51,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51 WrapperNode [2021-12-27 21:52:51,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:52:51,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:51,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:52:51,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:52:51,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,841 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2021-12-27 21:52:51,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:52:51,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:52:51,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:52:51,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:52:51,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:52:51,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:52:51,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:52:51,877 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:52:51,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (1/1) ... [2021-12-27 21:52:51,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:52:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:52:51,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:52:51,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:52:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:52:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-27 21:52:51,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:52:51,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:52:51,973 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:52:51,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:52:52,118 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:52:52,122 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:52:52,122 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-27 21:52:52,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:52 BoogieIcfgContainer [2021-12-27 21:52:52,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:52:52,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:52:52,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:52:52,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:52:52,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:52:51" (1/3) ... [2021-12-27 21:52:52,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb03d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:52, skipping insertion in model container [2021-12-27 21:52:52,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:52:51" (2/3) ... [2021-12-27 21:52:52,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb03d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:52:52, skipping insertion in model container [2021-12-27 21:52:52,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:52" (3/3) ... [2021-12-27 21:52:52,129 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2021-12-27 21:52:52,133 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:52:52,133 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:52:52,181 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:52:52,186 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:52:52,186 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:52:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-27 21:52:52,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:52,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-27 21:52:52,211 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:52,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-27 21:52:52,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:52,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120351344] [2021-12-27 21:52:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:52,228 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:52,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:52,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-27 21:52:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:52,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-27 21:52:52,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:52,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:52:52,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120351344] [2021-12-27 21:52:52,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120351344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:52:52,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:52:52,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:52:52,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141203824] [2021-12-27 21:52:52,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:52:52,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:52:52,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:52:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:52,377 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:52,393 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-27 21:52:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:52:52,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-27 21:52:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:52,400 INFO L225 Difference]: With dead ends: 20 [2021-12-27 21:52:52,400 INFO L226 Difference]: Without dead ends: 8 [2021-12-27 21:52:52,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:52:52,406 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:52,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-27 21:52:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-27 21:52:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-27 21:52:52,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-27 21:52:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:52,438 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-27 21:52:52,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-27 21:52:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-27 21:52:52,439 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:52,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:52,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:52,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:52,647 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:52,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:52,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-27 21:52:52,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:52,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555645428] [2021-12-27 21:52:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:52:52,650 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:52,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:52,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:52,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-27 21:52:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:52:52,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-27 21:52:52,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:52,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:52,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:52,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555645428] [2021-12-27 21:52:52,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555645428] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:52,740 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:52,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-27 21:52:52,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205936664] [2021-12-27 21:52:52,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:52,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:52:52,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:52,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:52:52,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:52:52,746 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2021-12-27 21:52:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:52,780 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-27 21:52:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:52:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) Word has length 7 [2021-12-27 21:52:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:52,780 INFO L225 Difference]: With dead ends: 15 [2021-12-27 21:52:52,780 INFO L226 Difference]: Without dead ends: 11 [2021-12-27 21:52:52,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:52:52,781 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:52,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-27 21:52:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-27 21:52:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) [2021-12-27 21:52:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-27 21:52:52,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-27 21:52:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:52,785 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-27 21:52:52,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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) [2021-12-27 21:52:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-27 21:52:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-27 21:52:52,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:52,785 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:52,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:52,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:52,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:52,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-27 21:52:52,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:52,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438665984] [2021-12-27 21:52:52,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-27 21:52:52,994 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:52,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:52,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-27 21:52:53,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-27 21:52:53,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-27 21:52:53,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:53,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:53,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:53,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438665984] [2021-12-27 21:52:53,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438665984] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:53,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:53,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-27 21:52:53,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636510469] [2021-12-27 21:52:53,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:53,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-27 21:52:53,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:53,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-27 21:52:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:52:53,197 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) 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) [2021-12-27 21:52:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:53,351 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2021-12-27 21:52:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:52:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) 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) Word has length 10 [2021-12-27 21:52:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:53,352 INFO L225 Difference]: With dead ends: 21 [2021-12-27 21:52:53,352 INFO L226 Difference]: Without dead ends: 17 [2021-12-27 21:52:53,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:52:53,353 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:53,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:52:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-27 21:52:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-27 21:52:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-12-27 21:52:53,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2021-12-27 21:52:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:53,358 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-12-27 21:52:53,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) 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) [2021-12-27 21:52:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-12-27 21:52:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-27 21:52:53,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:53,360 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:53,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-27 21:52:53,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:53,561 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2021-12-27 21:52:53,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:53,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525183901] [2021-12-27 21:52:53,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-27 21:52:53,562 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:53,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:53,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-27 21:52:53,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-27 21:52:53,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:53,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-27 21:52:53,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:53,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:52:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:54,081 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:52:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525183901] [2021-12-27 21:52:54,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525183901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:52:54,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:52:54,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-27 21:52:54,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731552446] [2021-12-27 21:52:54,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:52:54,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-27 21:52:54,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:52:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-27 21:52:54,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2021-12-27 21:52:54,083 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:54,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:52:54,921 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-27 21:52:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-27 21:52:54,921 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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 16 [2021-12-27 21:52:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:52:54,922 INFO L225 Difference]: With dead ends: 33 [2021-12-27 21:52:54,922 INFO L226 Difference]: Without dead ends: 29 [2021-12-27 21:52:54,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2021-12-27 21:52:54,923 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:52:54,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:52:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-27 21:52:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-27 21:52:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-12-27 21:52:54,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2021-12-27 21:52:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:52:54,930 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-12-27 21:52:54,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:52:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-12-27 21:52:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 21:52:54,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:52:54,931 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2021-12-27 21:52:54,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-27 21:52:55,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:52:55,138 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:52:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:52:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2021-12-27 21:52:55,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-27 21:52:55,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110487527] [2021-12-27 21:52:55,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-27 21:52:55,139 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-27 21:52:55,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-27 21:52:55,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-27 21:52:55,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-27 21:52:55,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-27 21:52:55,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-27 21:52:55,219 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-27 21:52:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:52:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:52:56,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-27 21:53:30,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~y~0#1| (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|)) (.cse1 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|))) (= (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse1 (_ bv16384 32)) (_ bv14 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse1 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv12 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse1 (_ bv1024 32)) (_ bv10 32))) (bvor (bvor (bvor (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse1 (_ bv128 32)) (_ bv7 32))) (bvor (bvor (bvor (bvor (bvshl (bvand (_ bv16 32) .cse1) (_ bv4 32)) (bvshl (bvand .cse0 (_ bv16 32)) (_ bv5 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse1 (_ bv8 32)) (_ bv3 32))) (bvor (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse1 (_ bv4 32)) (_ bv2 32))) (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse1 (_ bv1 32)) (_ bv0 32)))) (bvor (bvshl (bvand .cse1 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse0 (_ bv2 32)) (_ bv2 32))))))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse1 (_ bv32 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse1 (_ bv64 32)) (_ bv6 32))))) (bvor (bvshl (bvand (_ bv256 32) .cse1) (_ bv8 32)) (bvshl (bvand .cse0 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse1 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse0 (_ bv512 32)) (_ bv10 32)))))) (bvor (bvshl (bvand .cse1 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse1 (_ bv8192 32)) (_ bv13 32))))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse1 (_ bv32768 32)) (_ bv15 32)))) (let ((.cse31 (bvadd (_ bv15 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse29 (bvadd (_ bv14 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse4 (bvadd (_ bv13 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse3 (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse2 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse1 .cse2) .cse3) (bvshl (bvand .cse0 .cse2) .cse4))) (let ((.cse6 (bvadd (_ bv11 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse5 (bvshl (_ bv1 32) .cse6))) (bvor (bvshl (bvand .cse0 .cse5) .cse3) (bvshl (bvand .cse1 .cse5) .cse6))) (let ((.cse8 (bvadd (_ bv10 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse7 (bvshl (_ bv1 32) .cse8))) (bvor (bvshl (bvand .cse1 .cse7) .cse8) (bvshl (bvand .cse0 .cse7) .cse6))) (let ((.cse26 (bvadd (_ bv9 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse10 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse11 (bvadd (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse9 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse9) .cse10) (bvshl (bvand .cse1 .cse9) .cse11))) (let ((.cse13 (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse14 (bvadd (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse12 (bvshl (_ bv1 32) .cse14))) (bvor (bvshl (bvand .cse0 .cse12) .cse13) (bvshl (bvand .cse1 .cse12) .cse14))) (let ((.cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse0 .cse15) .cse14) (bvshl (bvand .cse1 .cse15) .cse16))) (let ((.cse18 (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse17 (bvshl (_ bv1 32) .cse18))) (bvor (bvshl (bvand .cse0 .cse17) .cse16) (bvshl (bvand .cse1 .cse17) .cse18))) (let ((.cse22 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (let ((.cse20 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse19 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse19) .cse20) (bvshl (bvand .cse1 .cse19) |c_ULTIMATE.start_main_~i~0#1|)))) (let ((.cse21 (bvshl (_ bv1 32) .cse20))) (bvor (bvshl (bvand .cse1 .cse21) .cse20) (bvshl (bvand .cse0 .cse21) .cse22))))) (let ((.cse23 (bvshl (_ bv1 32) .cse22))) (bvor (bvshl (bvand .cse1 .cse23) .cse22) (bvshl (bvand .cse0 .cse23) .cse18))))))))))) (let ((.cse24 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse24) .cse11) (bvshl (bvand .cse1 .cse24) .cse13))))))) (let ((.cse25 (bvshl (_ bv1 32) .cse10))) (bvor (bvshl (bvand .cse1 .cse25) .cse10) (bvshl (bvand .cse0 .cse25) .cse26))))) (let ((.cse27 (bvshl (_ bv1 32) .cse26))) (bvor (bvshl (bvand .cse1 .cse27) .cse26) (bvshl (bvand .cse0 .cse27) .cse8))))))))))) (let ((.cse28 (bvshl (_ bv1 32) .cse4))) (bvor (bvshl (bvand .cse28 .cse1) .cse4) (bvshl (bvand .cse0 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse1 .cse30) .cse29) (bvshl (bvand .cse0 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse32 .cse0) (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~i~0#1|)) (bvshl (bvand .cse32 .cse1) .cse31)))))))) is different from false [2021-12-27 21:53:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-27 21:53:30,643 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-27 21:53:30,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110487527] [2021-12-27 21:53:30,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110487527] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-27 21:53:30,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-27 21:53:30,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2021-12-27 21:53:30,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940129874] [2021-12-27 21:53:30,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-27 21:53:30,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-27 21:53:30,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-27 21:53:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-27 21:53:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2021-12-27 21:53:30,646 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:53:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:53:32,399 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2021-12-27 21:53:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 21:53:32,399 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-27 21:53:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:53:32,399 INFO L225 Difference]: With dead ends: 29 [2021-12-27 21:53:32,399 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 21:53:32,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2021-12-27 21:53:32,401 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-27 21:53:32,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.6s Time] [2021-12-27 21:53:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 21:53:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 21:53:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:53:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 21:53:32,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-12-27 21:53:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:53:32,402 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 21:53:32,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:53:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 21:53:32,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 21:53:32,404 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:53:32,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-27 21:53:32,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-27 21:53:32,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 21:53:33,360 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2021-12-27 21:53:33,361 INFO L861 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2021-12-27 21:53:33,362 INFO L854 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse6 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse5 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse1 (bvor (bvor (bvshl (bvand .cse5 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv2 32))) (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse5 (_ bv1 32)) (_ bv1 32)) (bvshl (bvand .cse6 (_ bv1 32)) (_ bv0 32)))) (bvor (bvshl (bvand .cse6 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse5 (_ bv2 32)) (_ bv2 32))))))) (let ((.cse15 (bvor (bvor (bvshl (bvand (_ bv16 32) .cse6) (_ bv4 32)) (bvshl (bvand .cse5 (_ bv16 32)) (_ bv5 32))) (bvor (bvor (bvshl (bvand .cse5 (_ bv8 32)) (_ bv4 32)) (bvshl (bvand .cse6 (_ bv8 32)) (_ bv3 32))) .cse1)))) (let ((.cse7 (bvor .cse15 (bvor (bvshl (bvand .cse5 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv5 32)))))) (let ((.cse14 (bvor (bvor (bvshl (bvand .cse5 (_ bv128 32)) (_ bv8 32)) (bvshl (bvand .cse6 (_ bv128 32)) (_ bv7 32))) (bvor .cse7 (bvor (bvshl (bvand .cse5 (_ bv64 32)) (_ bv7 32)) (bvshl (bvand .cse6 (_ bv64 32)) (_ bv6 32))))))) (let ((.cse2 (bvor .cse14 (bvor (bvshl (bvand (_ bv256 32) .cse6) (_ bv8 32)) (bvshl (bvand .cse5 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse3 (bvor .cse2 (bvor (bvshl (bvand .cse6 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse5 (_ bv512 32)) (_ bv10 32)))))) (let ((.cse9 (bvor (bvor (bvshl (bvand .cse5 (_ bv1024 32)) (_ bv11 32)) (bvshl (bvand .cse6 (_ bv1024 32)) (_ bv10 32))) .cse3))) (let ((.cse10 (bvor (bvor (bvshl (bvand .cse6 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse5 (_ bv2048 32)) (_ bv12 32))) .cse9))) (let ((.cse12 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|)) (.cse8 (bvor .cse10 (bvor (bvshl (bvand .cse6 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse5 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse0 (bvor (bvor (bvshl (bvand .cse5 (_ bv16384 32)) (_ bv15 32)) (bvshl (bvand .cse6 (_ bv16384 32)) (_ bv14 32))) (bvor .cse8 (bvor (bvshl (bvand .cse5 (_ bv8192 32)) (_ bv14 32)) (bvshl (bvand .cse6 (_ bv8192 32)) (_ bv13 32)))))) (.cse4 (let ((.cse16 (bvshl (_ bv1 32) .cse12))) (bvor (bvshl (bvand .cse6 .cse16) .cse12) (bvshl (bvand .cse5 .cse16) |ULTIMATE.start_main_~i~0#1|))))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~z~0#1| .cse0)) (and (= |ULTIMATE.start_main_~z~0#1| .cse1) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= |ULTIMATE.start_main_~z~0#1| .cse2)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~z~0#1| .cse3)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (bvor .cse4 (_ bv0 32)) |ULTIMATE.start_main_~z~0#1|)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse0 (bvor (bvshl (bvand .cse5 (_ bv32768 32)) (_ bv16 32)) (bvshl (bvand .cse6 (_ bv32768 32)) (_ bv15 32))))) (and (= (bvor .cse7 .cse4) |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse8 .cse4)) (= (_ bv14 32) |ULTIMATE.start_main_~i~0#1|)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32)) (= |ULTIMATE.start_main_~z~0#1| .cse9)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32)) (= |ULTIMATE.start_main_~z~0#1| .cse10)) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse4 (bvor (let ((.cse13 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32)))) (let ((.cse11 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse5 .cse11) .cse12) (bvshl (bvand .cse6 .cse11) .cse13)))) (_ bv0 32)))) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse14)) (and (= .cse7 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32))) (and (= .cse8 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= .cse15 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse1 .cse4)) (= (_ bv4 32) |ULTIMATE.start_main_~i~0#1|)))))))))))))) [2021-12-27 21:53:33,362 INFO L858 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2021-12-27 21:53:33,366 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2021-12-27 21:53:33,367 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-27 21:53:33,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:53:33 BoogieIcfgContainer [2021-12-27 21:53:33,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-27 21:53:33,400 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-27 21:53:33,400 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-27 21:53:33,400 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-27 21:53:33,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:52:52" (3/4) ... [2021-12-27 21:53:33,402 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-27 21:53:33,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-12-27 21:53:33,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-27 21:53:33,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-27 21:53:33,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-27 21:53:33,451 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-27 21:53:33,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-27 21:53:33,452 INFO L158 Benchmark]: Toolchain (without parser) took 41834.32ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 27.9MB in the beginning and 46.7MB in the end (delta: -18.9MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2021-12-27 21:53:33,452 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:53:33,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.03ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.7MB in the beginning and 44.4MB in the end (delta: -16.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-27 21:53:33,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.95ms. Allocated memory is still 60.8MB. Free memory was 44.4MB in the beginning and 42.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:53:33,453 INFO L158 Benchmark]: Boogie Preprocessor took 33.98ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 41.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-27 21:53:33,453 INFO L158 Benchmark]: RCFGBuilder took 247.70ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 32.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-27 21:53:33,453 INFO L158 Benchmark]: TraceAbstraction took 41274.64ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 53.0MB in the end (delta: -21.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2021-12-27 21:53:33,453 INFO L158 Benchmark]: Witness Printer took 51.46ms. Allocated memory is still 73.4MB. Free memory was 53.0MB in the beginning and 46.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-27 21:53:33,454 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.42ms. Allocated memory is still 50.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.03ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 27.7MB in the beginning and 44.4MB in the end (delta: -16.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.95ms. Allocated memory is still 60.8MB. Free memory was 44.4MB in the beginning and 42.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.98ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 41.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.70ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 32.2MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41274.64ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 53.0MB in the end (delta: -21.4MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 51.46ms. Allocated memory is still 73.4MB. Free memory was 53.0MB in the beginning and 46.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 25]: 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, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 30 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 35.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 2083 HoareAnnotationTreeSize, 2 FomulaSimplifications, 1505 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 381 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 36.2s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10109 SizeOfPredicates, 13 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((i == 15bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32))))) || (z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))) && i == 3bv32)) || (i == 9bv32 && z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))))) || (i == 10bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))) || (i == 1bv32 && ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i)), 0bv32) == z)) || z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32)))) || (~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))) == z && i == 7bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))) && 14bv32 == i)) || (i == 11bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32)))))) || (i == 12bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))))) || (z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(i, 4294967294bv32))), ~bvadd64(i, 4294967294bv32))), 0bv32)) && i == 2bv32)) || (i == 8bv32 && z == ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))))) || (~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))) == z && i == 6bv32)) || (i == 0bv32 && z == 0bv32)) || (~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1024bv32), 10bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32)), ~bvor32(~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32)))), ~bvor32(~bvshl32(~bvand32(256bv32, ~zero_extendFrom16To32(x)), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 512bv32), 9bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 512bv32), 10bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))) == z && i == 13bv32)) || (~bvor32(~bvor32(~bvshl32(~bvand32(16bv32, ~zero_extendFrom16To32(x)), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32)), ~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))))) == z && i == 5bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32)), ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), ~bvadd64(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd64(4294967295bv32, i))), i))) && 4bv32 == i) RESULT: Ultimate proved your program to be correct! [2021-12-27 21:53:33,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE