./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 b5317dae 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-?-b5317da-m [2023-02-16 00:40:47,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:40:47,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:40:47,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:40:47,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:40:47,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:40:47,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:40:47,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:40:47,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:40:47,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:40:47,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:40:47,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:40:47,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:40:47,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:40:47,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:40:47,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:40:47,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:40:47,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:40:47,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:40:47,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:40:47,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:40:47,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:40:47,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:40:47,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:40:47,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:40:47,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:40:47,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:40:47,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:40:47,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:40:47,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:40:47,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:40:47,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:40:47,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:40:47,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:40:47,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:40:47,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:40:47,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:40:47,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:40:47,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:40:47,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:40:47,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:40:47,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:40:47,509 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:40:47,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:40:47,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:40:47,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:40:47,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:40:47,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:40:47,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:40:47,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:40:47,512 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:40:47,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:40:47,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:40:47,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:40:47,514 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:40:47,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:40:47,514 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:40:47,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:40:47,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:40:47,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:40:47,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:40:47,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:40:47,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:40:47,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:40:47,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:40:47,516 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:40:47,517 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-16 00:40:47,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:40:47,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:40:47,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:40:47,720 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:40:47,720 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:40:47,721 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-16 00:40:48,619 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:40:48,757 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:40:48,757 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-16 00:40:48,762 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a12ddbd4/ae2590eb07a14f46b0672e9a2461752d/FLAG4d1b7709d [2023-02-16 00:40:48,779 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a12ddbd4/ae2590eb07a14f46b0672e9a2461752d [2023-02-16 00:40:48,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:40:48,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:40:48,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:40:48,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:40:48,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:40:48,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:48,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce27479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48, skipping insertion in model container [2023-02-16 00:40:48,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:48,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:40:48,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:40:48,901 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-16 00:40:48,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:40:48,925 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:40:48,932 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-16 00:40:48,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:40:48,948 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:40:48,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48 WrapperNode [2023-02-16 00:40:48,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:40:48,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:40:48,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:40:48,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:40:48,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:48,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:48,992 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2023-02-16 00:40:48,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:40:48,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:40:48,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:40:48,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:40:49,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,014 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:40:49,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:40:49,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:40:49,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:40:49,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (1/1) ... [2023-02-16 00:40:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:40:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:40:49,053 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-16 00:40:49,059 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-16 00:40:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:40:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:40:49,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:40:49,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:40:49,131 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:40:49,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:40:49,461 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:40:49,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:40:49,466 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:40:49,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:49 BoogieIcfgContainer [2023-02-16 00:40:49,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:40:49,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:40:49,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:40:49,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:40:49,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:40:48" (1/3) ... [2023-02-16 00:40:49,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3264c305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:40:49, skipping insertion in model container [2023-02-16 00:40:49,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:48" (2/3) ... [2023-02-16 00:40:49,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3264c305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:40:49, skipping insertion in model container [2023-02-16 00:40:49,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:49" (3/3) ... [2023-02-16 00:40:49,490 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-16 00:40:49,501 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:40:49,501 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:40:49,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:40:49,540 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;@16fba789, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:40:49,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:40:49,543 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-16 00:40:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:40:49,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:49,548 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-16 00:40:49,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash 943581884, now seen corresponding path program 1 times [2023-02-16 00:40:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:40:49,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652390119] [2023-02-16 00:40:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:40:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:40:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:40:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652390119] [2023-02-16 00:40:49,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652390119] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:40:49,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:40:49,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:40:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307042646] [2023-02-16 00:40:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:40:49,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:40:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:40:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:40:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:40:49,834 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-16 00:40:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:49,852 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2023-02-16 00:40:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:40:49,854 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-16 00:40:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:49,859 INFO L225 Difference]: With dead ends: 74 [2023-02-16 00:40:49,859 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:40:49,861 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-16 00:40:49,864 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-16 00:40:49,866 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-16 00:40:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:40:49,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-16 00:40:49,889 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-16 00:40:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-02-16 00:40:49,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 24 [2023-02-16 00:40:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:49,891 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-02-16 00:40:49,892 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-16 00:40:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-02-16 00:40:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:40:49,892 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:49,893 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-16 00:40:49,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:40:49,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1235775969, now seen corresponding path program 1 times [2023-02-16 00:40:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:40:49,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437172986] [2023-02-16 00:40:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:40:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:50,024 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-16 00:40:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:40:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437172986] [2023-02-16 00:40:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437172986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:40:50,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183351572] [2023-02-16 00:40:50,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:50,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:40:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:40:50,028 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-16 00:40:50,029 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-16 00:40:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:50,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 00:40:50,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:50,131 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-16 00:40:50,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:50,159 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-16 00:40:50,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183351572] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:50,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:40:50,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-16 00:40:50,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834694354] [2023-02-16 00:40:50,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:50,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:40:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:40:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:40:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:40:50,166 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-16 00:40:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:50,214 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2023-02-16 00:40:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:40:50,215 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-16 00:40:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:50,216 INFO L225 Difference]: With dead ends: 69 [2023-02-16 00:40:50,216 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:40:50,218 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-16 00:40:50,220 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-16 00:40:50,221 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-16 00:40:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:40:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-16 00:40:50,225 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-16 00:40:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-02-16 00:40:50,227 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 25 [2023-02-16 00:40:50,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:50,229 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-02-16 00:40:50,230 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-16 00:40:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-02-16 00:40:50,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 00:40:50,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:50,231 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-16 00:40:50,235 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-16 00:40:50,435 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-16 00:40:50,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:50,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2110190596, now seen corresponding path program 2 times [2023-02-16 00:40:50,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:40:50,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681789362] [2023-02-16 00:40:50,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:50,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:40:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:50,568 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-16 00:40:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:40:50,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681789362] [2023-02-16 00:40:50,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681789362] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:40:50,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979070879] [2023-02-16 00:40:50,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:40:50,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:40:50,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:40:50,573 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-16 00:40:50,575 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-16 00:40:50,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:40:50,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:40:50,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 00:40:50,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:50,680 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-16 00:40:50,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:50,735 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-16 00:40:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979070879] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:50,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:40:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-16 00:40:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087356473] [2023-02-16 00:40:50,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 00:40:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:40:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 00:40:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:40:50,737 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-16 00:40:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:50,906 INFO L93 Difference]: Finished difference Result 75 states and 116 transitions. [2023-02-16 00:40:50,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:40:50,909 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-16 00:40:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:50,909 INFO L225 Difference]: With dead ends: 75 [2023-02-16 00:40:50,909 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 00:40:50,910 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-16 00:40:50,910 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-16 00:40:50,910 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-16 00:40:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 00:40:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-16 00:40:50,916 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-16 00:40:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-02-16 00:40:50,917 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 28 [2023-02-16 00:40:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:50,917 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-02-16 00:40:50,918 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-16 00:40:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-02-16 00:40:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:40:50,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:50,920 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-16 00:40:50,927 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-16 00:40:51,127 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-16 00:40:51,127 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:51,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1506553380, now seen corresponding path program 3 times [2023-02-16 00:40:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:40:51,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30109573] [2023-02-16 00:40:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:40:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:51,460 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-16 00:40:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:40:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30109573] [2023-02-16 00:40:51,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30109573] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:40:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916155303] [2023-02-16 00:40:51,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:40:51,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:40:51,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:40:51,465 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-16 00:40:51,467 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-16 00:40:51,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-16 00:40:51,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:40:51,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 00:40:51,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:51,691 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-16 00:40:51,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:51,884 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-16 00:40:51,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916155303] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:51,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:40:51,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-16 00:40:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867873511] [2023-02-16 00:40:51,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:51,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 00:40:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:40:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 00:40:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2023-02-16 00:40:51,886 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-16 00:40:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:52,181 INFO L93 Difference]: Finished difference Result 81 states and 122 transitions. [2023-02-16 00:40:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:40:52,181 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-16 00:40:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:52,182 INFO L225 Difference]: With dead ends: 81 [2023-02-16 00:40:52,182 INFO L226 Difference]: Without dead ends: 50 [2023-02-16 00:40:52,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2023-02-16 00:40:52,183 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:40:52,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:40:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-16 00:40:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-16 00:40:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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-16 00:40:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2023-02-16 00:40:52,188 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 34 [2023-02-16 00:40:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:52,188 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-02-16 00:40:52,188 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-16 00:40:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2023-02-16 00:40:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:40:52,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:52,189 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-16 00:40:52,212 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-16 00:40:52,394 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-16 00:40:52,394 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -608522308, now seen corresponding path program 4 times [2023-02-16 00:40:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:40:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884242403] [2023-02-16 00:40:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:40:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 00:40:52,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 00:40:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 00:40:52,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 00:40:52,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 00:40:52,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:40:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:40:52,534 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-16 00:40:52,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:40:52,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:40:52 BoogieIcfgContainer [2023-02-16 00:40:52,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:40:52,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:40:52,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:40:52,561 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:40:52,561 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:49" (3/4) ... [2023-02-16 00:40:52,563 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-16 00:40:52,563 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:40:52,563 INFO L158 Benchmark]: Toolchain (without parser) took 3782.04ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 90.8MB in the beginning and 93.7MB in the end (delta: -3.0MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,564 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:40:52,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.37ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 79.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.62ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,564 INFO L158 Benchmark]: Boogie Preprocessor took 24.36ms. Allocated memory is still 130.0MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,565 INFO L158 Benchmark]: RCFGBuilder took 449.00ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 129.4MB in the end (delta: -55.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,565 INFO L158 Benchmark]: TraceAbstraction took 3076.44ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 93.7MB in the end (delta: 37.8MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2023-02-16 00:40:52,565 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 161.5MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:40:52,566 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 130.0MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.37ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 79.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.62ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 76.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.36ms. Allocated memory is still 130.0MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.00ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 129.4MB in the end (delta: -55.8MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3076.44ms. Allocated memory is still 161.5MB. Free memory was 131.6MB in the beginning and 93.7MB in the end (delta: 37.8MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 161.5MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 62. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, z=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: 3.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1339 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1131 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 208 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 582 SizeOfPredicates, 3 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-16 00:40:52,580 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-?-b5317da-m [2023-02-16 00:40:54,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:40:54,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:40:54,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:40:54,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:40:54,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:40:54,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:40:54,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:40:54,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:40:54,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:40:54,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:40:54,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:40:54,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:40:54,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:40:54,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:40:54,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:40:54,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:40:54,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:40:54,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:40:54,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:40:54,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:40:54,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:40:54,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:40:54,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:40:54,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:40:54,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:40:54,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:40:54,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:40:54,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:40:54,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:40:54,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:40:54,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:40:54,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:40:54,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:40:54,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:40:54,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:40:54,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:40:54,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:40:54,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:40:54,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:40:54,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:40:54,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-16 00:40:54,331 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:40:54,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:40:54,332 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:40:54,333 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:40:54,333 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:40:54,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:40:54,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:40:54,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:40:54,334 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:40:54,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:40:54,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:40:54,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:40:54,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:40:54,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:40:54,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:40:54,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:40:54,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:40:54,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:40:54,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:40:54,338 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 00:40:54,339 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:40:54,339 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-16 00:40:54,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:40:54,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:40:54,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:40:54,618 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:40:54,618 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:40:54,619 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-16 00:40:55,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:40:55,701 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:40:55,701 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-16 00:40:55,706 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b0f3efd/97be386399de4114a0c0e8a9dd748d47/FLAG441281b67 [2023-02-16 00:40:55,715 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b0f3efd/97be386399de4114a0c0e8a9dd748d47 [2023-02-16 00:40:55,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:40:55,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:40:55,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:40:55,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:40:55,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:40:55,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8036c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55, skipping insertion in model container [2023-02-16 00:40:55,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:40:55,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:40:55,868 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-16 00:40:55,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:40:55,895 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:40:55,906 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-16 00:40:55,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:40:55,935 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:40:55,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55 WrapperNode [2023-02-16 00:40:55,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:40:55,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:40:55,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:40:55,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:40:55,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,966 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-02-16 00:40:55,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:40:55,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:40:55,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:40:55,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:40:55,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:55,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:56,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:40:56,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:40:56,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:40:56,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:40:56,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (1/1) ... [2023-02-16 00:40:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:40:56,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:40:56,037 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-16 00:40:56,056 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-16 00:40:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:40:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 00:40:56,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:40:56,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:40:56,122 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:40:56,123 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:40:56,243 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:40:56,247 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:40:56,247 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:40:56,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:56 BoogieIcfgContainer [2023-02-16 00:40:56,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:40:56,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:40:56,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:40:56,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:40:56,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:40:55" (1/3) ... [2023-02-16 00:40:56,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5b4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:40:56, skipping insertion in model container [2023-02-16 00:40:56,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:40:55" (2/3) ... [2023-02-16 00:40:56,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e5b4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:40:56, skipping insertion in model container [2023-02-16 00:40:56,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:56" (3/3) ... [2023-02-16 00:40:56,254 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-16 00:40:56,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:40:56,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:40:56,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:40:56,312 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;@4c70384, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:40:56,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:40:56,315 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-16 00:40:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 00:40:56,321 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:56,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 00:40:56,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2023-02-16 00:40:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436930332] [2023-02-16 00:40:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:56,333 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-16 00:40:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:56,334 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-16 00:40:56,335 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-16 00:40:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:56,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:40:56,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:56,484 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-16 00:40:56,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:40:56,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:56,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436930332] [2023-02-16 00:40:56,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436930332] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:40:56,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:40:56,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:40:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784006548] [2023-02-16 00:40:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:40:56,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:40:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:56,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:40:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:40:56,516 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-16 00:40:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:56,534 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-02-16 00:40:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:40:56,537 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-16 00:40:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:56,542 INFO L225 Difference]: With dead ends: 20 [2023-02-16 00:40:56,542 INFO L226 Difference]: Without dead ends: 8 [2023-02-16 00:40:56,544 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-16 00:40:56,547 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-16 00:40:56,548 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-16 00:40:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-02-16 00:40:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-16 00:40:56,569 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-16 00:40:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-02-16 00:40:56,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-02-16 00:40:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:56,571 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-02-16 00:40:56,572 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-16 00:40:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-02-16 00:40:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 00:40:56,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:56,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:40:56,592 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-16 00:40:56,793 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-16 00:40:56,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2023-02-16 00:40:56,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:56,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789204503] [2023-02-16 00:40:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:40:56,797 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-16 00:40:56,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:56,799 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-16 00:40:56,802 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-16 00:40:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:40:56,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:40:56,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:56,852 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-16 00:40:56,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:56,886 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-16 00:40:56,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:56,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789204503] [2023-02-16 00:40:56,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789204503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:56,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:56,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 00:40:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930148915] [2023-02-16 00:40:56,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:56,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:40:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:40:56,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:40:56,891 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-16 00:40:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:56,933 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-02-16 00:40:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:40:56,934 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-16 00:40:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:56,934 INFO L225 Difference]: With dead ends: 15 [2023-02-16 00:40:56,934 INFO L226 Difference]: Without dead ends: 11 [2023-02-16 00:40:56,935 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-16 00:40:56,936 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-16 00:40:56,936 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-16 00:40:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-02-16 00:40:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-16 00:40:56,938 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-16 00:40:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-02-16 00:40:56,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-02-16 00:40:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:56,939 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-02-16 00:40:56,939 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-16 00:40:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-02-16 00:40:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 00:40:56,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:56,940 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-02-16 00:40:56,952 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-16 00:40:57,140 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-16 00:40:57,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2023-02-16 00:40:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:57,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440486541] [2023-02-16 00:40:57,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:40:57,142 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-16 00:40:57,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:57,143 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-16 00:40:57,144 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-16 00:40:57,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:40:57,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:40:57,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:40:57,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:57,245 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-16 00:40:57,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:57,329 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-16 00:40:57,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:57,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440486541] [2023-02-16 00:40:57,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440486541] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:57,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:57,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 00:40:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176205879] [2023-02-16 00:40:57,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:57,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:40:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:57,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:40:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:40:57,337 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-16 00:40:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:57,456 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-16 00:40:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:40:57,457 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-16 00:40:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:57,457 INFO L225 Difference]: With dead ends: 21 [2023-02-16 00:40:57,457 INFO L226 Difference]: Without dead ends: 17 [2023-02-16 00:40:57,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:40:57,459 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-16 00:40:57,459 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-16 00:40:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-16 00:40:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-16 00:40:57,462 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-16 00:40:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-02-16 00:40:57,463 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-02-16 00:40:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:57,463 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-02-16 00:40:57,463 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-16 00:40:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-02-16 00:40:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:40:57,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:57,464 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-02-16 00:40:57,477 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-16 00:40:57,670 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-16 00:40:57,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:57,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2023-02-16 00:40:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:57,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495649407] [2023-02-16 00:40:57,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:40:57,672 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-16 00:40:57,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:57,673 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-16 00:40:57,675 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-16 00:40:57,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-16 00:40:57,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:40:57,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:40:57,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:40:57,851 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-16 00:40:57,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:40:58,124 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-16 00:40:58,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:40:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495649407] [2023-02-16 00:40:58,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495649407] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:40:58,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:40:58,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-16 00:40:58,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629767665] [2023-02-16 00:40:58,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:40:58,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:40:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:40:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:40:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:40:58,126 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-16 00:40:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:40:58,990 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-02-16 00:40:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 00:40:58,990 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-16 00:40:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:40:58,991 INFO L225 Difference]: With dead ends: 33 [2023-02-16 00:40:58,991 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 00:40:58,992 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-16 00:40:58,993 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-16 00:40:58,993 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-16 00:40:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 00:40:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-16 00:40:58,998 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-16 00:40:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-02-16 00:40:58,999 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2023-02-16 00:40:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:40:58,999 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-02-16 00:40:58,999 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-16 00:40:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-02-16 00:40:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 00:40:59,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:40:59,000 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2023-02-16 00:40:59,007 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-16 00:40:59,207 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-16 00:40:59,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:40:59,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:40:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2023-02-16 00:40:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:40:59,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231444035] [2023-02-16 00:40:59,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:40:59,213 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-16 00:40:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:40:59,215 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-16 00:40:59,217 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-16 00:40:59,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:40:59,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:40:59,298 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 00:40:59,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:41:00,358 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-16 00:41:00,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:41:33,601 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_~x~0#1|)) (.cse2 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (= (let ((.cse31 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv15 32)))) (bvor (let ((.cse29 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv14 32)))) (bvor (let ((.cse27 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv13 32)))) (bvor (let ((.cse25 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv12 32)))) (bvor (let ((.cse23 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv11 32)))) (bvor (let ((.cse21 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv10 32)))) (bvor (let ((.cse19 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv9 32)))) (bvor (let ((.cse17 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv8 32)))) (bvor (let ((.cse15 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv7 32)))) (bvor (let ((.cse13 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv6 32)))) (bvor (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv5 32)))) (bvor (let ((.cse9 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (bvor (let ((.cse7 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv3 32)))) (bvor (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv2 32)))) (bvor (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)))) (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse1 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse1) |c_ULTIMATE.start_main_~i~0#1|) (bvshl (bvand .cse2 .cse1) .cse3)))) (let ((.cse4 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse0 .cse4) .cse3) (bvshl (bvand .cse2 .cse4) .cse5))))) (let ((.cse6 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse0 .cse6) .cse5) (bvshl (bvand .cse2 .cse6) .cse7))))) (let ((.cse8 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse0 .cse8) .cse7) (bvshl (bvand .cse2 .cse8) .cse9))))) (let ((.cse10 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse0 .cse10) .cse9) (bvshl (bvand .cse2 .cse10) .cse11))))) (let ((.cse12 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse12) .cse11) (bvshl (bvand .cse2 .cse12) .cse13))))) (let ((.cse14 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse14) .cse13) (bvshl (bvand .cse2 .cse14) .cse15))))) (let ((.cse16 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse0 .cse16) .cse15) (bvshl (bvand .cse2 .cse16) .cse17))))) (let ((.cse18 (bvshl (_ bv1 32) .cse17))) (bvor (bvshl (bvand .cse0 .cse18) .cse17) (bvshl (bvand .cse2 .cse18) .cse19))))) (let ((.cse20 (bvshl (_ bv1 32) .cse19))) (bvor (bvshl (bvand .cse0 .cse20) .cse19) (bvshl (bvand .cse2 .cse20) .cse21))))) (let ((.cse22 (bvshl (_ bv1 32) .cse21))) (bvor (bvshl (bvand .cse0 .cse22) .cse21) (bvshl (bvand .cse2 .cse22) .cse23))))) (let ((.cse24 (bvshl (_ bv1 32) .cse23))) (bvor (bvshl (bvand .cse0 .cse24) .cse23) (bvshl (bvand .cse2 .cse24) .cse25))))) (let ((.cse26 (bvshl (_ bv1 32) .cse25))) (bvor (bvshl (bvand .cse0 .cse26) .cse25) (bvshl (bvand .cse2 .cse26) .cse27))))) (let ((.cse28 (bvshl (_ bv1 32) .cse27))) (bvor (bvshl (bvand .cse0 .cse28) .cse27) (bvshl (bvand .cse2 .cse28) .cse29))))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse0 .cse30) .cse29) (bvshl (bvand .cse2 .cse30) .cse31))))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse0 .cse32) .cse31) (bvshl (bvand .cse2 .cse32) (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv16 32))))))) (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse2 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse0 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse2 (_ bv2 32)) (_ bv2 32)))) (bvor (bvshl (bvand .cse0 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse2 (_ bv4 32)) (_ bv3 32)))) (bvor (bvshl (bvand .cse0 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse2 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse0 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse2 (_ bv16 32)) (_ bv5 32)))) (bvor (bvshl (bvand .cse0 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse2 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse0 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse2 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse2 (_ bv128 32)) (_ bv8 32)))) (bvor (bvshl (bvand .cse0 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse2 (_ bv256 32)) (_ bv9 32)))) (bvor (bvshl (bvand .cse0 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse2 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse0 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse2 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse2 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse0 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse2 (_ bv4096 32)) (_ bv13 32)))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse2 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse0 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse2 (_ bv16384 32)) (_ bv15 32)))) (bvor (bvshl (bvand .cse0 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse2 (_ bv32768 32)) (_ bv16 32))))))) is different from false [2023-02-16 00:41:33,644 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-16 00:41:33,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:41:33,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231444035] [2023-02-16 00:41:33,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231444035] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:41:33,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:41:33,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-02-16 00:41:33,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247966133] [2023-02-16 00:41:33,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:41:33,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 00:41:33,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:41:33,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 00:41:33,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2023-02-16 00:41:33,646 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:41:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:41:34,829 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-02-16 00:41:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 00:41:34,830 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-16 00:41:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:41:34,830 INFO L225 Difference]: With dead ends: 29 [2023-02-16 00:41:34,830 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 00:41:34,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2023-02-16 00:41:34,831 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:41:34,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 1.0s Time] [2023-02-16 00:41:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 00:41:34,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 00:41:34,832 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-16 00:41:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 00:41:34,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-02-16 00:41:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:41:34,832 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 00:41:34,832 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-16 00:41:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 00:41:34,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 00:41:34,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:41:34,847 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-16 00:41:35,041 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-16 00:41:35,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2023-02-16 00:41:35,926 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2023-02-16 00:41:35,927 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse7 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse10 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (let ((.cse5 (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse7 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse10 (_ bv1 32)) (_ bv1 32)))) (bvor (bvshl (bvand .cse7 (_ bv2 32)) (_ bv1 32)) (bvshl (bvand .cse10 (_ bv2 32)) (_ bv2 32)))))) (let ((.cse12 (bvor .cse5 (bvor (bvshl (bvand .cse7 (_ bv4 32)) (_ bv2 32)) (bvshl (bvand .cse10 (_ bv4 32)) (_ bv3 32)))))) (let ((.cse1 (bvor (bvor .cse12 (bvor (bvshl (bvand .cse7 (_ bv8 32)) (_ bv3 32)) (bvshl (bvand .cse10 (_ bv8 32)) (_ bv4 32)))) (bvor (bvshl (bvand .cse7 (_ bv16 32)) (_ bv4 32)) (bvshl (bvand .cse10 (_ bv16 32)) (_ bv5 32)))))) (let ((.cse4 (bvor (bvor (bvor .cse1 (bvor (bvshl (bvand .cse7 (_ bv32 32)) (_ bv5 32)) (bvshl (bvand .cse10 (_ bv32 32)) (_ bv6 32)))) (bvor (bvshl (bvand .cse7 (_ bv64 32)) (_ bv6 32)) (bvshl (bvand .cse10 (_ bv64 32)) (_ bv7 32)))) (bvor (bvshl (bvand .cse7 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse10 (_ bv128 32)) (_ bv8 32)))))) (let ((.cse6 (bvor .cse4 (bvor (bvshl (bvand .cse7 (_ bv256 32)) (_ bv8 32)) (bvshl (bvand .cse10 (_ bv256 32)) (_ bv9 32)))))) (let ((.cse15 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967295 32))) (.cse11 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967294 32))) (.cse3 (bvor (bvor (bvor (bvor .cse6 (bvor (bvshl (bvand .cse7 (_ bv512 32)) (_ bv9 32)) (bvshl (bvand .cse10 (_ bv512 32)) (_ bv10 32)))) (bvor (bvshl (bvand .cse7 (_ bv1024 32)) (_ bv10 32)) (bvshl (bvand .cse10 (_ bv1024 32)) (_ bv11 32)))) (bvor (bvshl (bvand .cse7 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse10 (_ bv2048 32)) (_ bv12 32)))) (bvor (bvshl (bvand .cse7 (_ bv4096 32)) (_ bv12 32)) (bvshl (bvand .cse10 (_ bv4096 32)) (_ bv13 32)))))) (let ((.cse13 (bvor (bvor .cse3 (bvor (bvshl (bvand .cse7 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse10 (_ bv8192 32)) (_ bv14 32)))) (bvor (bvshl (bvand .cse7 (_ bv16384 32)) (_ bv14 32)) (bvshl (bvand .cse10 (_ bv16384 32)) (_ bv15 32))))) (.cse2 (let ((.cse16 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse7 .cse16) .cse11) (bvshl (bvand .cse10 .cse16) .cse15)))) (.cse0 (let ((.cse14 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse7 .cse14) .cse15) (bvshl (bvand .cse10 .cse14) |ULTIMATE.start_main_~i~0#1|))))) (or (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor (_ bv0 32) .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv7 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor .cse1 .cse2) .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv14 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse3 .cse0))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv8 32)) (= |ULTIMATE.start_main_~z~0#1| .cse4)) (and (= |ULTIMATE.start_main_~z~0#1| .cse1) (= |ULTIMATE.start_main_~i~0#1| (_ bv5 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~z~0#1| .cse5)) (and (= |ULTIMATE.start_main_~z~0#1| .cse3) (= |ULTIMATE.start_main_~i~0#1| (_ bv13 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor .cse1 .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv10 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse6 .cse0))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor (bvor .cse6 (let ((.cse9 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967293 32)))) (let ((.cse8 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse7 .cse8) .cse9) (bvshl (bvand .cse10 .cse8) .cse11))))) .cse2) .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv12 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv9 32)) (= |ULTIMATE.start_main_~z~0#1| .cse6)) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv4 32)) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse12 .cse0))) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse13 (bvor (bvshl (bvand .cse7 (_ bv32768 32)) (_ bv15 32)) (bvshl (bvand .cse10 (_ bv32768 32)) (_ bv16 32))))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv15 32)) (= |ULTIMATE.start_main_~z~0#1| .cse13)) (and (= |ULTIMATE.start_main_~z~0#1| .cse12) (= |ULTIMATE.start_main_~i~0#1| (_ bv3 32))) (and (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor .cse6 .cse2) .cse0)) (= |ULTIMATE.start_main_~i~0#1| (_ bv11 32))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32)))))))))))) [2023-02-16 00:41:35,927 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2023-02-16 00:41:35,929 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-16 00:41:35,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:41:35,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:41:35 BoogieIcfgContainer [2023-02-16 00:41:35,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:41:35,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:41:35,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:41:35,962 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:41:35,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:40:56" (3/4) ... [2023-02-16 00:41:35,964 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 00:41:35,970 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-16 00:41:35,970 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-16 00:41:35,970 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 00:41:35,970 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 00:41:36,004 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:41:36,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:41:36,005 INFO L158 Benchmark]: Toolchain (without parser) took 40286.92ms. Allocated memory was 65.0MB in the beginning and 121.6MB in the end (delta: 56.6MB). Free memory was 41.8MB in the beginning and 61.5MB in the end (delta: -19.7MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,005 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:41:36,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.29ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 30.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.73ms. Allocated memory is still 65.0MB. Free memory was 30.9MB in the beginning and 29.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,009 INFO L158 Benchmark]: Boogie Preprocessor took 35.60ms. Allocated memory is still 65.0MB. Free memory was 29.4MB in the beginning and 28.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:41:36,009 INFO L158 Benchmark]: RCFGBuilder took 244.95ms. Allocated memory is still 65.0MB. Free memory was 28.1MB in the beginning and 35.6MB in the end (delta: -7.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,010 INFO L158 Benchmark]: TraceAbstraction took 39711.66ms. Allocated memory was 65.0MB in the beginning and 121.6MB in the end (delta: 56.6MB). Free memory was 35.1MB in the beginning and 64.6MB in the end (delta: -29.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,010 INFO L158 Benchmark]: Witness Printer took 42.60ms. Allocated memory is still 121.6MB. Free memory was 64.6MB in the beginning and 61.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:41:36,012 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.22ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.29ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 30.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.73ms. Allocated memory is still 65.0MB. Free memory was 30.9MB in the beginning and 29.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.60ms. Allocated memory is still 65.0MB. Free memory was 29.4MB in the beginning and 28.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 244.95ms. Allocated memory is still 65.0MB. Free memory was 28.1MB in the beginning and 35.6MB in the end (delta: -7.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * TraceAbstraction took 39711.66ms. Allocated memory was 65.0MB in the beginning and 121.6MB in the end (delta: 56.6MB). Free memory was 35.1MB in the beginning and 64.6MB in the end (delta: -29.5MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 42.60ms. Allocated memory is still 121.6MB. Free memory was 64.6MB in the beginning and 61.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 39.6s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 1.1s 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, 34.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 2149 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 1842 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 35.0s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 10149 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 == 1bv32 && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i)))) || (i == 7bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))))) || (i == 14bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 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), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))))) || (i == 8bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))) && i == 5bv32)) || (i == 2bv32 && z == ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 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), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))) && i == 13bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))) && i == 6bv32)) || (i == 10bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))))) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967293bv32))), ~bvadd128(i, 4294967293bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967293bv32))), ~bvadd128(i, 4294967294bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))) && i == 12bv32)) || (i == 9bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))))) || (i == 4bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))))) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 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), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32768bv32), 15bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32768bv32), 16bv32)))) || (i == 15bv32 && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 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), 1024bv32), 10bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1024bv32), 11bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), 12bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4096bv32), 12bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4096bv32), 13bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), 14bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16384bv32), 14bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16384bv32), 15bv32))))) || (z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))) && i == 3bv32)) || (z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), 1bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2bv32), 1bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2bv32), 2bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 4bv32), 2bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 4bv32), 3bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8bv32), 3bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8bv32), 4bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 16bv32), 4bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 16bv32), 5bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 32bv32), 5bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 32bv32), 6bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 64bv32), 6bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 64bv32), 7bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), 8bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 256bv32), 8bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 256bv32), 9bv32))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967294bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967294bv32))), ~bvadd128(i, 4294967295bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), i))) && i == 11bv32)) || (i == 0bv32 && z == 0bv32) RESULT: Ultimate proved your program to be correct! [2023-02-16 00:41:36,061 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