./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 eb692b52 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-?-eb692b5 [2022-07-19 10:48:47,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:48:47,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:48:47,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:48:47,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:48:47,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:48:47,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:48:47,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:48:47,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:48:47,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:48:47,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:48:47,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:48:47,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:48:47,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:48:47,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:48:47,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:48:47,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:48:47,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:48:47,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:48:47,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:48:47,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:48:47,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:48:47,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:48:47,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:48:47,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:48:47,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:48:47,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:48:47,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:48:47,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:48:47,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:48:47,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:48:47,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:48:47,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:48:47,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:48:47,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:48:47,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:48:47,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:48:47,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:48:47,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:48:47,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:48:47,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:48:47,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:48:47,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:48:47,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:48:47,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:48:47,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:48:47,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:48:47,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:48:47,575 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:48:47,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:48:47,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:48:47,576 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:48:47,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:48:47,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:48:47,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:48:47,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:48:47,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:48:47,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:48:47,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:48:47,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:48:47,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:48:47,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:48:47,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:47,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:48:47,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:48:47,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:48:47,581 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 [2022-07-19 10:48:47,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:48:47,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:48:47,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:48:47,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:48:47,811 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:48:47,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-19 10:48:47,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62bc3f18/8858a0cec6da4a80aa93fb2fd2830b1c/FLAG87cf075e5 [2022-07-19 10:48:48,200 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:48:48,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-19 10:48:48,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62bc3f18/8858a0cec6da4a80aa93fb2fd2830b1c/FLAG87cf075e5 [2022-07-19 10:48:48,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62bc3f18/8858a0cec6da4a80aa93fb2fd2830b1c [2022-07-19 10:48:48,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:48:48,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:48:48,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:48,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:48:48,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:48:48,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fab1a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48, skipping insertion in model container [2022-07-19 10:48:48,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:48:48,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:48:48,381 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] [2022-07-19 10:48:48,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:48,409 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:48:48,417 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] [2022-07-19 10:48:48,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:48,434 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:48:48,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48 WrapperNode [2022-07-19 10:48:48,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:48,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:48,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:48:48,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:48:48,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,494 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2022-07-19 10:48:48,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:48,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:48:48,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:48:48,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:48:48,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:48:48,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:48:48,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:48:48,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:48:48,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (1/1) ... [2022-07-19 10:48:48,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:48,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:48:48,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:48:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:48:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:48:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:48:48,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:48:48,650 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:48:48,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:48:48,945 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:48:48,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:48:48,950 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:48:48,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:48 BoogieIcfgContainer [2022-07-19 10:48:48,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:48:48,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:48:48,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:48:48,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:48:48,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:48:48" (1/3) ... [2022-07-19 10:48:48,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5558dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:48, skipping insertion in model container [2022-07-19 10:48:48,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:48" (2/3) ... [2022-07-19 10:48:48,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5558dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:48, skipping insertion in model container [2022-07-19 10:48:48,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:48" (3/3) ... [2022-07-19 10:48:48,971 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2022-07-19 10:48:48,980 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:48:48,980 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:48:49,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:48:49,025 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@334abe64, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b483ef4 [2022-07-19 10:48:49,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:48:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:48:49,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:49,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:49,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 545893010, now seen corresponding path program 1 times [2022-07-19 10:48:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759459877] [2022-07-19 10:48:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:49,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759459877] [2022-07-19 10:48:49,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759459877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:48:49,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:48:49,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:48:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322454324] [2022-07-19 10:48:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:48:49,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:48:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:48:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:49,303 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.8695652173913044) internal successors, (86), 47 states have internal predecessors, (86), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:49,400 INFO L93 Difference]: Finished difference Result 124 states and 221 transitions. [2022-07-19 10:48:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:48:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 16 [2022-07-19 10:48:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:49,408 INFO L225 Difference]: With dead ends: 124 [2022-07-19 10:48:49,410 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 10:48:49,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:49,415 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:49,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 100 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:48:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 10:48:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-07-19 10:48:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2022-07-19 10:48:49,446 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 16 [2022-07-19 10:48:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:49,446 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2022-07-19 10:48:49,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2022-07-19 10:48:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:48:49,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:49,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:49,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:48:49,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash -255758641, now seen corresponding path program 1 times [2022-07-19 10:48:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533773983] [2022-07-19 10:48:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:49,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533773983] [2022-07-19 10:48:49,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533773983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:48:49,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:48:49,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:48:49,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052268433] [2022-07-19 10:48:49,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:48:49,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:48:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:48:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:49,504 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:49,514 INFO L93 Difference]: Finished difference Result 126 states and 182 transitions. [2022-07-19 10:48:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:48:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-19 10:48:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:49,515 INFO L225 Difference]: With dead ends: 126 [2022-07-19 10:48:49,515 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 10:48:49,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:49,516 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:49,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 10:48:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-19 10:48:49,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2022-07-19 10:48:49,523 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 17 [2022-07-19 10:48:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:49,523 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2022-07-19 10:48:49,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2022-07-19 10:48:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:48:49,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:49,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:49,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:48:49,525 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1991346358, now seen corresponding path program 1 times [2022-07-19 10:48:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:49,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770708522] [2022-07-19 10:48:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:49,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:49,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770708522] [2022-07-19 10:48:49,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770708522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:48:49,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657677566] [2022-07-19 10:48:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:49,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:48:49,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:48:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:49,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:48:49,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:49,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:49,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657677566] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:49,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:48:49,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-19 10:48:49,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327777287] [2022-07-19 10:48:49,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:49,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:48:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:48:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:48:49,824 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:49,850 INFO L93 Difference]: Finished difference Result 129 states and 187 transitions. [2022-07-19 10:48:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:48:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) Word has length 18 [2022-07-19 10:48:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:49,851 INFO L225 Difference]: With dead ends: 129 [2022-07-19 10:48:49,851 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 10:48:49,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:48:49,852 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:49,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 10:48:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 10:48:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-07-19 10:48:49,857 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 18 [2022-07-19 10:48:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:49,858 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-07-19 10:48:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-07-19 10:48:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:48:49,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:49,859 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:49,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:50,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:50,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash 805123471, now seen corresponding path program 2 times [2022-07-19 10:48:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:50,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942222789] [2022-07-19 10:48:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942222789] [2022-07-19 10:48:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942222789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:48:50,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681561989] [2022-07-19 10:48:50,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:48:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:50,219 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:48:50,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:48:50,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:48:50,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:50,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:48:50,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:50,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681561989] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:50,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:48:50,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-19 10:48:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362095241] [2022-07-19 10:48:50,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:50,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 10:48:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 10:48:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:48:50,543 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:50,726 INFO L93 Difference]: Finished difference Result 135 states and 196 transitions. [2022-07-19 10:48:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:48:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:48:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:50,730 INFO L225 Difference]: With dead ends: 135 [2022-07-19 10:48:50,731 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 10:48:50,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:48:50,732 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:50,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 368 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 10:48:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-19 10:48:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2022-07-19 10:48:50,742 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 21 [2022-07-19 10:48:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:50,742 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-07-19 10:48:50,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2022-07-19 10:48:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:48:50,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:50,743 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:50,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:48:50,961 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash -951891025, now seen corresponding path program 3 times [2022-07-19 10:48:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048093543] [2022-07-19 10:48:50,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:50,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:48:51,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048093543] [2022-07-19 10:48:51,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048093543] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:48:51,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157652734] [2022-07-19 10:48:51,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:48:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:51,268 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) [2022-07-19 10:48:51,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:48:51,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-19 10:48:51,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:51,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 10:48:51,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:51,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:52,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157652734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:52,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:48:52,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-19 10:48:52,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347117757] [2022-07-19 10:48:52,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:52,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 10:48:52,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:48:52,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 10:48:52,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:48:52,030 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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) [2022-07-19 10:48:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:52,357 INFO L93 Difference]: Finished difference Result 141 states and 202 transitions. [2022-07-19 10:48:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 10:48:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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 27 [2022-07-19 10:48:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:52,361 INFO L225 Difference]: With dead ends: 141 [2022-07-19 10:48:52,362 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 10:48:52,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2022-07-19 10:48:52,364 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:48:52,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 978 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:48:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 10:48:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-19 10:48:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-07-19 10:48:52,373 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 27 [2022-07-19 10:48:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:52,374 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-07-19 10:48:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.64) internal successors, (41), 25 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) [2022-07-19 10:48:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-07-19 10:48:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 10:48:52,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:52,376 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:52,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:52,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:48:52,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:52,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1209513521, now seen corresponding path program 4 times [2022-07-19 10:48:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:48:52,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184501971] [2022-07-19 10:48:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:48:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:48:53,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:48:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:48:53,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:48:53,383 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:48:53,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:48:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:48:53,389 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-19 10:48:53,391 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:48:53,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:48:53 BoogieIcfgContainer [2022-07-19 10:48:53,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:48:53,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:48:53,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:48:53,432 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:48:53,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:48" (3/4) ... [2022-07-19 10:48:53,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 10:48:53,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:48:53,436 INFO L158 Benchmark]: Toolchain (without parser) took 5215.44ms. Allocated memory was 96.5MB in the beginning and 182.5MB in the end (delta: 86.0MB). Free memory was 65.3MB in the beginning and 101.7MB in the end (delta: -36.3MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,436 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:48:53,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.80ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.9MB in the beginning and 91.4MB in the end (delta: -26.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.91ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 78.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,437 INFO L158 Benchmark]: Boogie Preprocessor took 54.43ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 71.0MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,437 INFO L158 Benchmark]: RCFGBuilder took 401.27ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.0MB in the end (delta: 2.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,437 INFO L158 Benchmark]: TraceAbstraction took 4479.53ms. Allocated memory was 117.4MB in the beginning and 182.5MB in the end (delta: 65.0MB). Free memory was 68.6MB in the beginning and 101.7MB in the end (delta: -33.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-07-19 10:48:53,437 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 182.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:48:53,439 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.15ms. Allocated memory is still 96.5MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.80ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.9MB in the beginning and 91.4MB in the end (delta: -26.5MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.91ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 78.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.43ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 71.0MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 401.27ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.0MB in the end (delta: 2.0MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4479.53ms. Allocated memory was 117.4MB in the beginning and 182.5MB in the end (delta: 65.0MB). Free memory was 68.6MB in the beginning and 101.7MB in the end (delta: -33.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 182.5MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 62. 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, 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=2, 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=3, 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=4, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, z=1] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, z=4294967295] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, z=4294967295] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, z=4294967295] [L53] xx = x [L54] yy = y VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L55] xx = (xx | (xx << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L56] xx = (xx | (xx << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L57] xx = (xx | (xx << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L58] xx = (xx | (xx << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L59] yy = (yy | (yy << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L60] yy = (yy | (yy << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L61] yy = (yy | (yy << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L62] yy = (yy | (yy << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295] [L64] zz = xx | (yy << 1U) VAL [i=16, x=0, xx=0, y=0, yy=0, z=4294967295, zz=0] [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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1877 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1567 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 310 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=5, InterpolantAutomatonStates: 42, 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 537 SizeOfPredicates, 3 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 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 [2022-07-19 10:48:53,478 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-?-eb692b5 [2022-07-19 10:48:55,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:48:55,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:48:55,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:48:55,188 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:48:55,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:48:55,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:48:55,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:48:55,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:48:55,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:48:55,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:48:55,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:48:55,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:48:55,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:48:55,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:48:55,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:48:55,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:48:55,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:48:55,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:48:55,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:48:55,215 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:48:55,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:48:55,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:48:55,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:48:55,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:48:55,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:48:55,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:48:55,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:48:55,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:48:55,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:48:55,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:48:55,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:48:55,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:48:55,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:48:55,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:48:55,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:48:55,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:48:55,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:48:55,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:48:55,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:48:55,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:48:55,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:48:55,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 10:48:55,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:48:55,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:48:55,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:48:55,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:48:55,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:48:55,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:48:55,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:48:55,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:48:55,265 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:48:55,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:48:55,266 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:48:55,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:48:55,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:48:55,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:48:55,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:48:55,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:48:55,267 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 10:48:55,267 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 10:48:55,267 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:48:55,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:48:55,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:48:55,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:55,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:48:55,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:48:55,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:48:55,269 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 10:48:55,269 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 10:48:55,270 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:48:55,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:48:55,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:48:55,270 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 10:48:55,270 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 [2022-07-19 10:48:55,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:48:55,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:48:55,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:48:55,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:48:55,537 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:48:55,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-19 10:48:55,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48601d60b/26eb8a3a9dd5446a8b7c220c3a6eb513/FLAGf4c1a963d [2022-07-19 10:48:55,939 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:48:55,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2022-07-19 10:48:55,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48601d60b/26eb8a3a9dd5446a8b7c220c3a6eb513/FLAGf4c1a963d [2022-07-19 10:48:56,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48601d60b/26eb8a3a9dd5446a8b7c220c3a6eb513 [2022-07-19 10:48:56,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:48:56,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:48:56,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:56,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:48:56,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:48:56,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45855e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56, skipping insertion in model container [2022-07-19 10:48:56,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:48:56,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:48:56,449 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] [2022-07-19 10:48:56,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:56,465 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:48:56,482 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] [2022-07-19 10:48:56,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:48:56,536 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:48:56,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56 WrapperNode [2022-07-19 10:48:56,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:48:56,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:56,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:48:56,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:48:56,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,589 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2022-07-19 10:48:56,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:48:56,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:48:56,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:48:56,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:48:56,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:48:56,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:48:56,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:48:56,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:48:56,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (1/1) ... [2022-07-19 10:48:56,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:48:56,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:48:56,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:48:56,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:48:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:48:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 10:48:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:48:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:48:56,757 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:48:56,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:48:56,870 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:48:56,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:48:56,876 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:48:56,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:56 BoogieIcfgContainer [2022-07-19 10:48:56,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:48:56,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:48:56,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:48:56,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:48:56,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:48:56" (1/3) ... [2022-07-19 10:48:56,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:56, skipping insertion in model container [2022-07-19 10:48:56,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:48:56" (2/3) ... [2022-07-19 10:48:56,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:48:56, skipping insertion in model container [2022-07-19 10:48:56,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:56" (3/3) ... [2022-07-19 10:48:56,897 INFO L111 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2022-07-19 10:48:56,906 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:48:56,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:48:56,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:48:56,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a722f98, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61132043 [2022-07-19 10:48:56,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:48:56,995 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) [2022-07-19 10:48:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 10:48:56,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:56,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 10:48:56,999 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2022-07-19 10:48:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:48:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212161200] [2022-07-19 10:48:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:48:57,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:48:57,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:48:57,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 10:48:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:57,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 10:48:57,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:57,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:48:57,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:48:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212161200] [2022-07-19 10:48:57,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212161200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:48:57,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:48:57,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:48:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204162428] [2022-07-19 10:48:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:48:57,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:48:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:48:57,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:48:57,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:57,111 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) [2022-07-19 10:48:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:57,125 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-07-19 10:48:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:48:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-19 10:48:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:57,132 INFO L225 Difference]: With dead ends: 20 [2022-07-19 10:48:57,132 INFO L226 Difference]: Without dead ends: 8 [2022-07-19 10:48:57,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:48:57,139 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:48:57,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:57,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-19 10:48:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-19 10:48:57,159 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) [2022-07-19 10:48:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-07-19 10:48:57,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-07-19 10:48:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:57,161 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-07-19 10:48:57,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:48:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-07-19 10:48:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-19 10:48:57,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:57,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:57,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:57,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:48:57,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:57,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2022-07-19 10:48:57,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:48:57,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585380247] [2022-07-19 10:48:57,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:48:57,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:48:57,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:48:57,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:48:57,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 10:48:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:48:57,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:48:57,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:57,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:57,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:48:57,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585380247] [2022-07-19 10:48:57,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585380247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:57,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:48:57,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 10:48:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229353789] [2022-07-19 10:48:57,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:57,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:48:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:48:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:48:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:48:57,467 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) [2022-07-19 10:48:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:57,491 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-07-19 10:48:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:48:57,491 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 [2022-07-19 10:48:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:57,492 INFO L225 Difference]: With dead ends: 15 [2022-07-19 10:48:57,492 INFO L226 Difference]: Without dead ends: 11 [2022-07-19 10:48:57,492 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:48:57,493 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:48:57,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-19 10:48:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-19 10:48:57,496 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) [2022-07-19 10:48:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-19 10:48:57,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2022-07-19 10:48:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:57,497 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-19 10:48:57,497 INFO L496 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) [2022-07-19 10:48:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-19 10:48:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-19 10:48:57,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:57,498 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:57,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-19 10:48:57,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:48:57,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2022-07-19 10:48:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:48:57,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859178214] [2022-07-19 10:48:57,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:48:57,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:48:57,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:48:57,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:48:57,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 10:48:57,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:48:57,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:57,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:48:57,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:57,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:57,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:48:57,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859178214] [2022-07-19 10:48:57,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859178214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:57,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:48:57,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-19 10:48:57,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640146711] [2022-07-19 10:48:57,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:57,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:48:57,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:48:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:48:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:48:57,867 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) [2022-07-19 10:48:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:57,980 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-07-19 10:48:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:48:57,980 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 [2022-07-19 10:48:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:57,981 INFO L225 Difference]: With dead ends: 21 [2022-07-19 10:48:57,981 INFO L226 Difference]: Without dead ends: 17 [2022-07-19 10:48:57,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:48:57,982 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:48:57,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:48:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-19 10:48:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-19 10:48:57,987 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) [2022-07-19 10:48:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-07-19 10:48:57,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-07-19 10:48:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:57,987 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-07-19 10:48:57,988 INFO L496 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) [2022-07-19 10:48:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-07-19 10:48:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:48:57,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:57,988 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:58,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:58,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:48:58,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2022-07-19 10:48:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:48:58,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135235912] [2022-07-19 10:48:58,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:48:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:48:58,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:48:58,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:48:58,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 10:48:58,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-19 10:48:58,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:58,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:48:58,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:48:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:58,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:48:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:48:58,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:48:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135235912] [2022-07-19 10:48:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135235912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:48:58,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:48:58,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-19 10:48:58,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247436335] [2022-07-19 10:48:58,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:48:58,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 10:48:58,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:48:58,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 10:48:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:48:58,654 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) [2022-07-19 10:48:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:48:59,436 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-19 10:48:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:48:59,437 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 [2022-07-19 10:48:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:48:59,437 INFO L225 Difference]: With dead ends: 33 [2022-07-19 10:48:59,437 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 10:48:59,438 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:48:59,439 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:48:59,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:48:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 10:48:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-19 10:48:59,467 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) [2022-07-19 10:48:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-07-19 10:48:59,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2022-07-19 10:48:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:48:59,468 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-07-19 10:48:59,468 INFO L496 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) [2022-07-19 10:48:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-07-19 10:48:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:48:59,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:48:59,469 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2022-07-19 10:48:59,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:48:59,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:48:59,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:48:59,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:48:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2022-07-19 10:48:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 10:48:59,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890854582] [2022-07-19 10:48:59,679 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:48:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 10:48:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 10:48:59,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 10:48:59,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 10:48:59,774 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:48:59,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:48:59,785 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 10:48:59,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:49:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:49:00,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:49:35,891 WARN L833 $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 [2022-07-19 10:49:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-19 10:49:35,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 10:49:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890854582] [2022-07-19 10:49:35,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890854582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:49:35,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:49:35,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2022-07-19 10:49:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344345682] [2022-07-19 10:49:35,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 10:49:35,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 10:49:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 10:49:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 10:49:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2022-07-19 10:49:35,937 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) [2022-07-19 10:49:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:49:37,711 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-19 10:49:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:49:37,711 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 [2022-07-19 10:49:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:49:37,712 INFO L225 Difference]: With dead ends: 29 [2022-07-19 10:49:37,712 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:49:37,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2022-07-19 10:49:37,713 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:49:37,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.6s Time] [2022-07-19 10:49:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:49:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:49:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:49:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:49:37,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-07-19 10:49:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:49:37,717 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:49:37,717 INFO L496 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) [2022-07-19 10:49:37,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:49:37,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:49:37,719 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:49:37,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-19 10:49:37,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 10:49:37,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:49:38,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:49:38,712 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2022-07-19 10:49:38,713 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2022-07-19 10:49:38,713 INFO L895 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|)))))))))))))) [2022-07-19 10:49:38,713 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2022-07-19 10:49:38,716 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-07-19 10:49:38,718 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:49:38,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:49:38 BoogieIcfgContainer [2022-07-19 10:49:38,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:49:38,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:49:38,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:49:38,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:49:38,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:48:56" (3/4) ... [2022-07-19 10:49:38,774 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:49:38,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-19 10:49:38,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-19 10:49:38,780 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:49:38,781 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:49:38,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:49:38,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:49:38,815 INFO L158 Benchmark]: Toolchain (without parser) took 42476.10ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 41.2MB in the beginning and 71.4MB in the end (delta: -30.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,815 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:49:38,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.25ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 43.7MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.40ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:49:38,816 INFO L158 Benchmark]: Boogie Preprocessor took 51.80ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 41.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,816 INFO L158 Benchmark]: RCFGBuilder took 248.88ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 31.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,817 INFO L158 Benchmark]: TraceAbstraction took 41877.35ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 31.0MB in the beginning and 74.6MB in the end (delta: -43.6MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,817 INFO L158 Benchmark]: Witness Printer took 44.27ms. Allocated memory is still 98.6MB. Free memory was 74.6MB in the beginning and 71.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:49:38,819 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 196.25ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 43.7MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.40ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.80ms. Allocated memory is still 60.8MB. Free memory was 42.1MB in the beginning and 41.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.88ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 31.5MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41877.35ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 31.0MB in the beginning and 74.6MB in the end (delta: -43.6MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 44.27ms. Allocated memory is still 98.6MB. Free memory was 74.6MB in the beginning and 71.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 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, 36.5s 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.2s SatisfiabilityAnalysisTime, 36.7s 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! [2022-07-19 10:49:38,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE