./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 a31fd051 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-?-a31fd05 [2023-02-15 10:20:54,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:20:54,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:20:54,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:20:54,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:20:54,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:20:54,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:20:54,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:20:54,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:20:54,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:20:54,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:20:54,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:20:54,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:20:54,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:20:54,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:20:54,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:20:54,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:20:54,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:20:54,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:20:54,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:20:54,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:20:54,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:20:54,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:20:54,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:20:54,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:20:54,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:20:54,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:20:54,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:20:54,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:20:54,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:20:54,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:20:54,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:20:54,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:20:54,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:20:54,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:20:54,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:20:54,442 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:20:54,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:20:54,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:20:54,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:20:54,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:20:54,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:20:54,469 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:20:54,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:20:54,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:20:54,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:20:54,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:20:54,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:20:54,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:20:54,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:20:54,471 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:20:54,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:20:54,472 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:20:54,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:20:54,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:20:54,473 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:20:54,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:20:54,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:20:54,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:20:54,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:20:54,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:20:54,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:20:54,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:20:54,476 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:20:54,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:20:54,476 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:20:54,476 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-02-15 10:20:54,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:20:54,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:20:54,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:20:54,691 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:20:54,691 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:20:54,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-15 10:20:55,658 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:20:55,799 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:20:55,800 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-15 10:20:55,804 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef50c7cf4/da6c3e03b3574f2a996786298ff8bb1a/FLAG42bc0864a [2023-02-15 10:20:55,813 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef50c7cf4/da6c3e03b3574f2a996786298ff8bb1a [2023-02-15 10:20:55,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:20:55,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:20:55,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:20:55,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:20:55,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:20:55,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:55,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d78400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55, skipping insertion in model container [2023-02-15 10:20:55,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:55,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:20:55,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:20:55,920 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-15 10:20:55,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:20:55,943 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:20:55,951 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-15 10:20:55,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:20:55,968 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:20:55,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55 WrapperNode [2023-02-15 10:20:55,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:20:55,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:20:55,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:20:55,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:20:55,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:55,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,011 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2023-02-15 10:20:56,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:20:56,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:20:56,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:20:56,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:20:56,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:20:56,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:20:56,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:20:56,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:20:56,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (1/1) ... [2023-02-15 10:20:56,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:20:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:20:56,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:20:56,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:20:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:20:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:20:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:20:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:20:56,181 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:20:56,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:20:56,469 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:20:56,474 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:20:56,474 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 10:20:56,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:56 BoogieIcfgContainer [2023-02-15 10:20:56,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:20:56,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:20:56,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:20:56,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:20:56,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:20:55" (1/3) ... [2023-02-15 10:20:56,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e27b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:20:56, skipping insertion in model container [2023-02-15 10:20:56,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:20:55" (2/3) ... [2023-02-15 10:20:56,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e27b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:20:56, skipping insertion in model container [2023-02-15 10:20:56,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:56" (3/3) ... [2023-02-15 10:20:56,488 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-15 10:20:56,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:20:56,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:20:56,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:20:56,565 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2181f243, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:20:56,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:20:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:20:56,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:20:56,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:20:56,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:20:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:20:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 943581884, now seen corresponding path program 1 times [2023-02-15 10:20:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:20:56,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031374112] [2023-02-15 10:20:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:20:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:20:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:20:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:56,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:20:56,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031374112] [2023-02-15 10:20:56,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031374112] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:20:56,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:20:56,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:20:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445551027] [2023-02-15 10:20:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:20:56,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:20:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:20:56,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:20:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:20:56,947 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:20:56,983 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2023-02-15 10:20:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:20:56,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2023-02-15 10:20:56,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:20:56,990 INFO L225 Difference]: With dead ends: 74 [2023-02-15 10:20:56,991 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 10:20:56,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:20:56,996 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 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 [2023-02-15 10:20:56,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:20:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 10:20:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-15 10:20:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-02-15 10:20:57,028 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 24 [2023-02-15 10:20:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:20:57,029 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-02-15 10:20:57,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-02-15 10:20:57,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:20:57,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:20:57,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:20:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:20:57,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:20:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:20:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1235775969, now seen corresponding path program 1 times [2023-02-15 10:20:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:20:57,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516543074] [2023-02-15 10:20:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:20:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:20:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:20:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:20:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516543074] [2023-02-15 10:20:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516543074] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:20:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807775313] [2023-02-15 10:20:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:20:57,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:20:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:20:57,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:20:57,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:20:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:20:57,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 10:20:57,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:20:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:20:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807775313] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:20:57,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:20:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-15 10:20:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436446174] [2023-02-15 10:20:57,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:20:57,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:20:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:20:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:20:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:20:57,268 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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) [2023-02-15 10:20:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:20:57,295 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2023-02-15 10:20:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:20:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 10:20:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:20:57,296 INFO L225 Difference]: With dead ends: 69 [2023-02-15 10:20:57,296 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:20:57,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:20:57,298 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:20:57,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:20:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:20:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 10:20:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-02-15 10:20:57,309 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 25 [2023-02-15 10:20:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:20:57,310 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-02-15 10:20:57,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 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) [2023-02-15 10:20:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-02-15 10:20:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 10:20:57,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:20:57,311 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:20:57,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:20:57,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:20:57,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:20:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:20:57,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2110190596, now seen corresponding path program 2 times [2023-02-15 10:20:57,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:20:57,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531822060] [2023-02-15 10:20:57,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:20:57,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:20:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:20:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:20:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531822060] [2023-02-15 10:20:57,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531822060] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:20:57,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257026017] [2023-02-15 10:20:57,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:20:57,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:20:57,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:20:57,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:20:57,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:20:57,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:20:57,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:20:57,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 10:20:57,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:20:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:20:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:57,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257026017] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:20:57,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:20:57,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-15 10:20:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524442166] [2023-02-15 10:20:57,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:20:57,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:20:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:20:57,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:20:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:20:57,855 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:20:58,016 INFO L93 Difference]: Finished difference Result 75 states and 116 transitions. [2023-02-15 10:20:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:20:58,022 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 10:20:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:20:58,022 INFO L225 Difference]: With dead ends: 75 [2023-02-15 10:20:58,022 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 10:20:58,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:20:58,023 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:20:58,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:20:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 10:20:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-15 10:20:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-02-15 10:20:58,030 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 28 [2023-02-15 10:20:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:20:58,031 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-02-15 10:20:58,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:20:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-02-15 10:20:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:20:58,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:20:58,033 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:20:58,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:20:58,237 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,SelfDestructingSolverStorable2 [2023-02-15 10:20:58,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:20:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:20:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1506553380, now seen corresponding path program 3 times [2023-02-15 10:20:58,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:20:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665321821] [2023-02-15 10:20:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:20:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:20:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:20:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:20:58,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665321821] [2023-02-15 10:20:58,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665321821] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:20:58,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494249229] [2023-02-15 10:20:58,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:20:58,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:20:58,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:20:58,609 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) [2023-02-15 10:20:58,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:20:58,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 10:20:58,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:20:58,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 10:20:58,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:20:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:58,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:20:59,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:20:59,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494249229] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:20:59,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:20:59,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-15 10:20:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904702374] [2023-02-15 10:20:59,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:20:59,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 10:20:59,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:20:59,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 10:20:59,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:20:59,163 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:11,534 INFO L93 Difference]: Finished difference Result 87 states and 134 transitions. [2023-02-15 10:21:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 10:21:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 10:21:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:11,536 INFO L225 Difference]: With dead ends: 87 [2023-02-15 10:21:11,536 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 10:21:11,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=394, Invalid=866, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 10:21:11,537 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 485 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:11,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 109 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 10:21:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 10:21:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-15 10:21:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2023-02-15 10:21:11,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 34 [2023-02-15 10:21:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:11,544 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2023-02-15 10:21:11,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2023-02-15 10:21:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:21:11,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:11,545 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:21:11,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:11,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:21:11,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -608522308, now seen corresponding path program 4 times [2023-02-15 10:21:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:21:11,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533110887] [2023-02-15 10:21:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:21:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:21:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:21:11,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 10:21:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 10:21:11,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 10:21:11,889 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 10:21:11,890 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:21:11,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:21:11,893 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-15 10:21:11,895 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:21:11,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:11 BoogieIcfgContainer [2023-02-15 10:21:11,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:21:11,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:21:11,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:21:11,919 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:21:11,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:20:56" (3/4) ... [2023-02-15 10:21:11,921 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 10:21:11,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:21:11,922 INFO L158 Benchmark]: Toolchain (without parser) took 16106.21ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 74.6MB in the beginning and 64.5MB in the end (delta: 10.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,923 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:21:11,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.27ms. Allocated memory is still 119.5MB. Free memory was 74.6MB in the beginning and 63.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.07ms. Allocated memory is still 119.5MB. Free memory was 63.3MB in the beginning and 60.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,923 INFO L158 Benchmark]: Boogie Preprocessor took 30.37ms. Allocated memory is still 119.5MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,923 INFO L158 Benchmark]: RCFGBuilder took 432.87ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 100.9MB in the end (delta: -43.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,924 INFO L158 Benchmark]: TraceAbstraction took 15440.93ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 99.7MB in the beginning and 64.5MB in the end (delta: 35.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2023-02-15 10:21:11,924 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 174.1MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:21:11,926 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.27ms. Allocated memory is still 119.5MB. Free memory was 74.6MB in the beginning and 63.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.07ms. Allocated memory is still 119.5MB. Free memory was 63.3MB in the beginning and 60.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.37ms. Allocated memory is still 119.5MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.87ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 100.9MB in the end (delta: -43.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15440.93ms. Allocated memory was 144.7MB in the beginning and 174.1MB in the end (delta: 29.4MB). Free memory was 99.7MB in the beginning and 64.5MB in the end (delta: 35.2MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 174.1MB. Free memory is still 64.5MB. 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=3] [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=3] [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=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, z=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [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=3] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, z=3] [L53] xx = x [L54] yy = y VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L55] xx = (xx | (xx << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L56] xx = (xx | (xx << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L57] xx = (xx | (xx << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L58] xx = (xx | (xx << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L59] yy = (yy | (yy << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L60] yy = (yy | (yy << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L61] yy = (yy | (yy << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L62] yy = (yy | (yy << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 485 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 858 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 651 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 207 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 670 SizeOfPredicates, 3 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-15 10:21:11,945 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-?-a31fd05 [2023-02-15 10:21:13,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:21:13,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:21:13,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:21:13,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:21:13,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:21:13,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:21:13,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:21:13,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:21:13,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:21:13,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:21:13,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:21:13,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:21:13,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:21:13,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:21:13,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:21:13,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:21:13,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:21:13,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:21:13,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:21:13,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:21:13,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:21:13,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:21:13,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:21:13,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:21:13,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:21:13,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:21:13,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:21:13,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:21:13,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:21:13,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:21:13,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:21:13,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:21:13,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:21:13,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:21:13,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:21:13,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:21:13,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:21:13,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:21:13,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:21:13,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:21:13,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-15 10:21:13,995 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:21:13,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:21:13,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:21:13,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:21:13,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:21:13,997 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:21:13,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:21:13,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:21:13,998 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:21:13,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:21:13,999 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:21:14,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:21:14,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:21:14,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:21:14,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:21:14,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:21:14,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:21:14,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:21:14,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:21:14,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:21:14,003 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 10:21:14,003 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:21:14,003 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-02-15 10:21:14,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:21:14,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:21:14,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:21:14,325 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:21:14,330 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:21:14,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-15 10:21:15,469 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:21:15,682 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:21:15,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-15 10:21:15,688 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434f1719/b44a96b20c37486ea9f98761b9ad9462/FLAG49c0112a1 [2023-02-15 10:21:15,700 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f434f1719/b44a96b20c37486ea9f98761b9ad9462 [2023-02-15 10:21:15,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:21:15,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:21:15,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:21:15,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:21:15,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:21:15,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c4f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15, skipping insertion in model container [2023-02-15 10:21:15,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:21:15,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:21:15,848 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-15 10:21:15,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:21:15,878 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:21:15,887 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-15 10:21:15,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:21:15,915 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:21:15,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15 WrapperNode [2023-02-15 10:21:15,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:21:15,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:21:15,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:21:15,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:21:15,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,941 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-02-15 10:21:15,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:21:15,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:21:15,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:21:15,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:21:15,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:21:15,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:21:15,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:21:15,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:21:15,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (1/1) ... [2023-02-15 10:21:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:21:15,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:21:16,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:21:16,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:21:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:21:16,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 10:21:16,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:21:16,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:21:16,112 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:21:16,114 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:21:16,208 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:21:16,212 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:21:16,212 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 10:21:16,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16 BoogieIcfgContainer [2023-02-15 10:21:16,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:21:16,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:21:16,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:21:16,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:21:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:21:15" (1/3) ... [2023-02-15 10:21:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335f2862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:16, skipping insertion in model container [2023-02-15 10:21:16,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:21:15" (2/3) ... [2023-02-15 10:21:16,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335f2862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:21:16, skipping insertion in model container [2023-02-15 10:21:16,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16" (3/3) ... [2023-02-15 10:21:16,219 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-15 10:21:16,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:21:16,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:21:16,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:21:16,260 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77b6da22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:21:16,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:21:16,263 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) [2023-02-15 10:21:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 10:21:16,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:16,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 10:21:16,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2023-02-15 10:21:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:16,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160355668] [2023-02-15 10:21:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:21:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:16,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 10:21:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:21:16,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 10:21:16,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:16,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:21:16,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:16,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160355668] [2023-02-15 10:21:16,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160355668] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:21:16,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:21:16,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:21:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397773897] [2023-02-15 10:21:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:21:16,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:21:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:21:16,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:21:16,436 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) [2023-02-15 10:21:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:16,455 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-02-15 10:21:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:21:16,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 10:21:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:16,462 INFO L225 Difference]: With dead ends: 20 [2023-02-15 10:21:16,462 INFO L226 Difference]: Without dead ends: 8 [2023-02-15 10:21:16,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:21:16,466 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 [2023-02-15 10:21:16,466 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] [2023-02-15 10:21:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-02-15 10:21:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-15 10:21:16,483 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) [2023-02-15 10:21:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-02-15 10:21:16,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-02-15 10:21:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:16,485 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-02-15 10:21:16,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-02-15 10:21:16,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 10:21:16,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:16,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:21:16,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:16,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:16,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2023-02-15 10:21:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:16,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418152057] [2023-02-15 10:21:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:21:16,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:16,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:16,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:16,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 10:21:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:21:16,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:21:16,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:16,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:21:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:16,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:16,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418152057] [2023-02-15 10:21:16,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418152057] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:21:16,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:21:16,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-15 10:21:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033540153] [2023-02-15 10:21:16,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:21:16,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:21:16,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:21:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:21:16,805 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) [2023-02-15 10:21:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:16,845 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-02-15 10:21:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:21:16,846 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 [2023-02-15 10:21:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:16,846 INFO L225 Difference]: With dead ends: 15 [2023-02-15 10:21:16,846 INFO L226 Difference]: Without dead ends: 11 [2023-02-15 10:21:16,846 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 [2023-02-15 10:21:16,847 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:16,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:21:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-02-15 10:21:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-15 10:21:16,850 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) [2023-02-15 10:21:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-02-15 10:21:16,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-02-15 10:21:16,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:16,851 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-02-15 10:21:16,851 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) [2023-02-15 10:21:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-02-15 10:21:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 10:21:16,860 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:16,860 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-02-15 10:21:16,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:17,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:17,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:17,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2023-02-15 10:21:17,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:17,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345499334] [2023-02-15 10:21:17,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:21:17,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:17,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:17,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 10:21:17,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:21:17,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:21:17,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:21:17,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:17,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:21:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:17,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:17,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345499334] [2023-02-15 10:21:17,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345499334] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:21:17,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:21:17,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 10:21:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626951594] [2023-02-15 10:21:17,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:21:17,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:21:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:21:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:21:17,226 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) [2023-02-15 10:21:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:17,334 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-15 10:21:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:21:17,335 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 [2023-02-15 10:21:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:17,335 INFO L225 Difference]: With dead ends: 21 [2023-02-15 10:21:17,335 INFO L226 Difference]: Without dead ends: 17 [2023-02-15 10:21:17,335 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 [2023-02-15 10:21:17,336 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:17,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:21:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-15 10:21:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-15 10:21:17,340 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) [2023-02-15 10:21:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-02-15 10:21:17,340 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-02-15 10:21:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:17,341 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-02-15 10:21:17,341 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) [2023-02-15 10:21:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-02-15 10:21:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:21:17,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:17,342 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-02-15 10:21:17,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:17,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:17,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:17,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2023-02-15 10:21:17,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:17,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750458440] [2023-02-15 10:21:17,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:21:17,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:17,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:17,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:17,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 10:21:17,614 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-15 10:21:17,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:21:17,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 10:21:17,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:17,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:21:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:17,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:17,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750458440] [2023-02-15 10:21:17,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750458440] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:21:17,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:21:17,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-15 10:21:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013945336] [2023-02-15 10:21:17,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:21:17,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 10:21:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 10:21:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:21:17,993 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) [2023-02-15 10:21:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:18,817 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-02-15 10:21:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 10:21:18,818 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 [2023-02-15 10:21:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:18,818 INFO L225 Difference]: With dead ends: 33 [2023-02-15 10:21:18,818 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 10:21:18,819 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 [2023-02-15 10:21:18,819 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:18,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:21:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 10:21:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-15 10:21:18,825 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) [2023-02-15 10:21:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-02-15 10:21:18,826 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2023-02-15 10:21:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:18,826 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-02-15 10:21:18,826 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) [2023-02-15 10:21:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-02-15 10:21:18,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:21:18,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:21:18,827 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2023-02-15 10:21:18,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:19,037 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:21:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:21:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2023-02-15 10:21:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 10:21:19,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813218226] [2023-02-15 10:21:19,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:21:19,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:19,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 10:21:19,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 10:21:19,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 10:21:19,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:21:19,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:21:19,139 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 10:21:19,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:21:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:21:20,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:21:54,321 WARN L837 $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 [2023-02-15 10:21:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-15 10:21:54,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 10:21:54,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813218226] [2023-02-15 10:21:54,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813218226] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:21:54,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:21:54,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-02-15 10:21:54,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521618118] [2023-02-15 10:21:54,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:21:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-15 10:21:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 10:21:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-15 10:21:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 10:21:54,390 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) [2023-02-15 10:21:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:21:55,459 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-02-15 10:21:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:21:55,459 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 [2023-02-15 10:21:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:21:55,460 INFO L225 Difference]: With dead ends: 29 [2023-02-15 10:21:55,460 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 10:21:55,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2023-02-15 10:21:55,461 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 10:21:55,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 0.9s Time] [2023-02-15 10:21:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 10:21:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 10:21:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:21:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 10:21:55,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-02-15 10:21:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:21:55,462 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 10:21:55,462 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) [2023-02-15 10:21:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 10:21:55,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 10:21:55,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:21:55,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:21:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 10:21:55,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 10:21:56,411 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2023-02-15 10:21:56,412 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2023-02-15 10:21:56,412 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 ((.cse12 (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 ((.cse1 (bvor (bvor (bvshl (bvand .cse5 (_ bv4 32)) (_ bv3 32)) (bvshl (bvand .cse6 (_ bv4 32)) (_ bv2 32))) .cse12))) (let ((.cse13 (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 .cse13 (bvor (bvshl (bvand .cse5 (_ bv32 32)) (_ bv6 32)) (bvshl (bvand .cse6 (_ bv32 32)) (_ bv5 32)))))) (let ((.cse11 (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 .cse11 (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 ((.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 ((.cse15 (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse6 .cse14) .cse15) (bvshl (bvand .cse5 .cse14) |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_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse11)) (and (= .cse7 |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~z~0#1| .cse12) (= |ULTIMATE.start_main_~i~0#1| (_ bv2 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 (= .cse13 |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|))))))))))))))) [2023-02-15 10:21:56,412 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2023-02-15 10:21:56,414 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-15 10:21:56,416 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:21:56,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:21:56 BoogieIcfgContainer [2023-02-15 10:21:56,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:21:56,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:21:56,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:21:56,447 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:21:56,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:21:16" (3/4) ... [2023-02-15 10:21:56,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 10:21:56,465 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-15 10:21:56,465 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-15 10:21:56,465 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 10:21:56,465 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 10:21:56,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:21:56,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:21:56,493 INFO L158 Benchmark]: Toolchain (without parser) took 40788.60ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 48.9MB in the beginning and 88.8MB in the end (delta: -39.9MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-02-15 10:21:56,493 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:21:56,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.31ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 37.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 10:21:56,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.60ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:21:56,494 INFO L158 Benchmark]: Boogie Preprocessor took 34.25ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 35.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:21:56,494 INFO L158 Benchmark]: RCFGBuilder took 236.79ms. Allocated memory is still 71.3MB. Free memory was 35.2MB in the beginning and 42.3MB in the end (delta: -7.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-02-15 10:21:56,495 INFO L158 Benchmark]: TraceAbstraction took 40231.32ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 41.8MB in the beginning and 92.0MB in the end (delta: -50.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2023-02-15 10:21:56,495 INFO L158 Benchmark]: Witness Printer took 46.13ms. Allocated memory is still 125.8MB. Free memory was 92.0MB in the beginning and 88.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:21:56,497 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 49.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.31ms. Allocated memory is still 71.3MB. Free memory was 48.6MB in the beginning and 37.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.60ms. Allocated memory is still 71.3MB. Free memory was 37.9MB in the beginning and 36.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.25ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 35.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 236.79ms. Allocated memory is still 71.3MB. Free memory was 35.2MB in the beginning and 42.3MB in the end (delta: -7.2MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40231.32ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 41.8MB in the beginning and 92.0MB in the end (delta: -50.2MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 46.13ms. Allocated memory is still 125.8MB. Free memory was 92.0MB in the beginning and 88.8MB 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: 40.2s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 30 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 35.8s 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, 2061 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 1842 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10061 SizeOfPredicates, 14 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, ~bvadd128(4294967295bv32, i))), ~bvadd128(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(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, ~bvadd128(4294967295bv32, i))), ~bvadd128(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(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, ~bvadd128(4294967295bv32, i))), ~bvadd128(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(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))))))) || (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)) || (z == ~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 == 2bv32)) || (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, ~bvadd128(4294967295bv32, i))), ~bvadd128(4294967295bv32, i)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(4294967295bv32, i))), i))) && 4bv32 == i) RESULT: Ultimate proved your program to be correct! [2023-02-15 10:21:56,549 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