./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_tiling_poly6.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-cav19/array_tiling_poly6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26ad3956041b2e839611ff318d272e1f932670752c1f7180f45920516dc03b70 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:02,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:02,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:02,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:02,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:02,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:02,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:02,337 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:02,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:02,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:02,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:02,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:02,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:02,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:02,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:02,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:02,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:02,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:02,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:02,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:02,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:02,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:02,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:02,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:02,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:02,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:02,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:02,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:02,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:02,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:02,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:02,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:02,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:02,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:02,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:02,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:02,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:02,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:02,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:02,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:02,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:02,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:26:02,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:02,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:02,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:02,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:02,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:02,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:02,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:02,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:02,413 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:02,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:02,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:02,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:02,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:02,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:02,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:02,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:02,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26ad3956041b2e839611ff318d272e1f932670752c1f7180f45920516dc03b70 [2022-02-20 14:26:02,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:02,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:02,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:02,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:02,604 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:02,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2022-02-20 14:26:02,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786fea163/49f99c7d4d544992ac3a2e7687af0c09/FLAG8b624a895 [2022-02-20 14:26:02,968 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:02,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2022-02-20 14:26:02,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786fea163/49f99c7d4d544992ac3a2e7687af0c09/FLAG8b624a895 [2022-02-20 14:26:03,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786fea163/49f99c7d4d544992ac3a2e7687af0c09 [2022-02-20 14:26:03,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:03,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:03,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:03,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:03,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:03,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5acbcd5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03, skipping insertion in model container [2022-02-20 14:26:03,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:03,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:03,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] [2022-02-20 14:26:03,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:03,599 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:03,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] [2022-02-20 14:26:03,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:03,623 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:03,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03 WrapperNode [2022-02-20 14:26:03,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:03,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:03,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:03,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:03,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,649 INFO L137 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2022-02-20 14:26:03,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:03,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:03,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:03,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:03,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:03,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:03,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:03,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:03,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (1/1) ... [2022-02-20 14:26:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:03,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:03,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:26:03,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:26:03,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:26:03,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:26:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:26:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:03,764 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:03,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:03,933 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:03,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:03,950 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:26:03,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:03 BoogieIcfgContainer [2022-02-20 14:26:03,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:03,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:03,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:03,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:03,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:03" (1/3) ... [2022-02-20 14:26:03,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39b438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:03, skipping insertion in model container [2022-02-20 14:26:03,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:03" (2/3) ... [2022-02-20 14:26:03,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39b438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:03, skipping insertion in model container [2022-02-20 14:26:03,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:03" (3/3) ... [2022-02-20 14:26:03,962 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2022-02-20 14:26:03,965 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:03,966 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:03,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:03,999 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:26:03,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:26:04,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:04,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:04,014 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2022-02-20 14:26:04,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:04,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329336741] [2022-02-20 14:26:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:04,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:04,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-02-20 14:26:04,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~S~0#1 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 14:26:04,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 14:26:04,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:26:04,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 14:26:04,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:26:04,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 14:26:04,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0#1 := 0; {24#false} is VALID [2022-02-20 14:26:04,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if -1 == main_#t~mem9#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:26:04,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:26:04,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:26:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:04,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:04,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329336741] [2022-02-20 14:26:04,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329336741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:04,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:04,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:26:04,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126197437] [2022-02-20 14:26:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) Word has length 11 [2022-02-20 14:26:04,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:04,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:04,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:26:04,207 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:26:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:04,226 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,262 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 14:26:04,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:26:04,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) Word has length 11 [2022-02-20 14:26:04,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:04,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 14:26:04,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:04,335 INFO L225 Difference]: With dead ends: 37 [2022-02-20 14:26:04,335 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 14:26:04,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:04,340 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:04,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 14:26:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 14:26:04,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:04,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,369 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,370 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,374 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:26:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:04,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:04,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:04,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:04,376 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,378 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:26:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:04,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:04,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:04,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:04,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-20 14:26:04,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-02-20 14:26:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:04,382 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-20 14:26:04,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:26:04,387 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:04,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:04,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:26:04,389 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2022-02-20 14:26:04,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:04,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477357412] [2022-02-20 14:26:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:04,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-02-20 14:26:04,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~S~0#1 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123#true} is VALID [2022-02-20 14:26:04,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume !(0 == assume_abort_if_not_~cond#1); {123#true} is VALID [2022-02-20 14:26:04,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {123#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {125#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:26:04,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {125#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~S~0#1); {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} is VALID [2022-02-20 14:26:04,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} main_~i~0#1 := 0; {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} is VALID [2022-02-20 14:26:04,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} assume !(main_~i~0#1 < main_~S~0#1); {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} is VALID [2022-02-20 14:26:04,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(<= |ULTIMATE.start_main_~S~0#1| 0)} main_~i~0#1 := 0; {127#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~S~0#1| 0))} is VALID [2022-02-20 14:26:04,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~S~0#1| 0))} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if -1 == main_#t~mem9#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {124#false} is VALID [2022-02-20 14:26:04,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} assume 0 == __VERIFIER_assert_~cond#1; {124#false} is VALID [2022-02-20 14:26:04,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 14:26:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:04,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:04,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477357412] [2022-02-20 14:26:04,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477357412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:04,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:04,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:26:04,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124588899] [2022-02-20 14:26:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 11 [2022-02-20 14:26:04,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:04,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:04,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:26:04,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:26:04,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:04,512 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,619 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 14:26:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:26:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 11 [2022-02-20 14:26:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:26:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-02-20 14:26:04,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-02-20 14:26:04,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:04,657 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:26:04,657 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:04,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:04,658 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:04,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2022-02-20 14:26:04,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:04,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,661 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,661 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,662 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:04,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:04,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:04,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-02-20 14:26:04,663 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-02-20 14:26:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:04,664 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:04,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:04,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:04,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:04,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 14:26:04,666 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-02-20 14:26:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:04,666 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 14:26:04,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:26:04,667 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:04,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:04,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:26:04,668 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2022-02-20 14:26:04,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:04,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488707014] [2022-02-20 14:26:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:04,687 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:26:04,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298705392] [2022-02-20 14:26:04,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:04,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:04,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:04,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:26:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:04,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:26:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:04,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:04,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-02-20 14:26:04,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~S~0#1 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {262#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 |ULTIMATE.start_main_~S~0#1|)) (and (not (< 1 |ULTIMATE.start_main_~S~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 14:26:04,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 |ULTIMATE.start_main_~S~0#1|)) (and (not (< 1 |ULTIMATE.start_main_~S~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {266#(< 1 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:04,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#(< 1 |ULTIMATE.start_main_~S~0#1|)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {270#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:26:04,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {270#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~S~0#1);call write~int((main_~i~0#1 - 1) * (1 + main_~i~0#1), main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8); {270#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 14:26:04,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {270#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {277#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:26:04,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(and (< 1 |ULTIMATE.start_main_~S~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < main_~S~0#1); {255#false} is VALID [2022-02-20 14:26:04,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#false} main_~i~0#1 := 0; {255#false} is VALID [2022-02-20 14:26:04,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#false} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);call write~int(main_#t~mem7#1 - main_~i~0#1 * main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem7#1; {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#false} assume !(main_~i~0#1 < main_~S~0#1); {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#false} main_~i~0#1 := 0; {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if -1 == main_#t~mem9#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond#1; {255#false} is VALID [2022-02-20 14:26:04,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-02-20 14:26:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:04,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:05,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond#1; {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem9#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if -1 == main_#t~mem9#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {255#false} main_~i~0#1 := 0; {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#false} assume !(main_~i~0#1 < main_~S~0#1); {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {255#false} is VALID [2022-02-20 14:26:05,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#false} assume !!(main_~i~0#1 < main_~S~0#1);call main_#t~mem7#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);call write~int(main_#t~mem7#1 - main_~i~0#1 * main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem7#1; {255#false} is VALID [2022-02-20 14:26:05,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#false} main_~i~0#1 := 0; {255#false} is VALID [2022-02-20 14:26:05,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~S~0#1|)} assume !(main_~i~0#1 < main_~S~0#1); {255#false} is VALID [2022-02-20 14:26:05,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {329#(< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:05,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {333#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} assume !!(main_~i~0#1 < main_~S~0#1);call write~int((main_~i~0#1 - 1) * (1 + main_~i~0#1), main_~#a~0#1.base, main_~#a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8); {333#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:05,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#(< 1 |ULTIMATE.start_main_~S~0#1|)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(8 * main_~S~0#1);main_~i~0#1 := 0; {333#(< (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:05,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#(or (< 1 |ULTIMATE.start_main_~S~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {266#(< 1 |ULTIMATE.start_main_~S~0#1|)} is VALID [2022-02-20 14:26:05,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~S~0#1 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {343#(or (< 1 |ULTIMATE.start_main_~S~0#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 14:26:05,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-02-20 14:26:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:05,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:05,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488707014] [2022-02-20 14:26:05,076 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:26:05,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298705392] [2022-02-20 14:26:05,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298705392] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:05,077 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:26:05,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-02-20 14:26:05,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515239820] [2022-02-20 14:26:05,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:05,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 15 [2022-02-20 14:26:05,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:05,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:05,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:05,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:26:05,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:26:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:26:05,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:26:05,104 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,336 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-02-20 14:26:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:26:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 15 [2022-02-20 14:26:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:26:05,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:26:05,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-02-20 14:26:05,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:05,385 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:26:05,385 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:26:05,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:05,386 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 74 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:05,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:26:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-02-20 14:26:05,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:05,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:05,398 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:05,398 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,399 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 14:26:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 14:26:05,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:05,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:05,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) Second operand 36 states. [2022-02-20 14:26:05,400 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) Second operand 36 states. [2022-02-20 14:26:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:05,401 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 14:26:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 14:26:05,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:05,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:05,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:05,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 14:26:05,403 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-02-20 14:26:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:05,403 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 14:26:05,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 14:26:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:26:05,404 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:05,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:05,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:05,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:05,620 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:05,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 2 times [2022-02-20 14:26:05,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:26:05,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485585993] [2022-02-20 14:26:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:26:05,634 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:26:05,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733364019] [2022-02-20 14:26:05,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:05,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:26:05,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:05,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:26:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:26:05,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:05,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:05,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 14:26:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:05,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:05,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-02-20 14:26:05,832 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 14:26:05,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-02-20 14:26:05,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2022-02-20 14:26:05,960 INFO L356 Elim1Store]: treesize reduction 116, result has 10.1 percent of original size [2022-02-20 14:26:05,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 107 [2022-02-20 14:26:06,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:26:06,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485585993] [2022-02-20 14:26:06,160 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:26:06,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733364019] [2022-02-20 14:26:06,160 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 14:26:06,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:06,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 14:26:06,376 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: transformation to positive normal form unsound at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:78) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:490) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:422) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:311) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:327) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:234) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:201) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:185) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:111) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateCompat(PartialQuantifierElimination.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 14:26:06,380 INFO L158 Benchmark]: Toolchain (without parser) took 2949.66ms. Allocated memory was 98.6MB in the beginning and 159.4MB in the end (delta: 60.8MB). Free memory was 70.8MB in the beginning and 130.5MB in the end (delta: -59.7MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-02-20 14:26:06,380 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:06,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.38ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 70.6MB in the beginning and 105.1MB in the end (delta: -34.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:26:06,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 132.1MB. Free memory was 105.1MB in the beginning and 103.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:26:06,381 INFO L158 Benchmark]: Boogie Preprocessor took 17.18ms. Allocated memory is still 132.1MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:06,381 INFO L158 Benchmark]: RCFGBuilder took 284.00ms. Allocated memory is still 132.1MB. Free memory was 102.0MB in the beginning and 90.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:26:06,381 INFO L158 Benchmark]: TraceAbstraction took 2421.93ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 89.9MB in the beginning and 130.5MB in the end (delta: -40.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:26:06,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.38ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 70.6MB in the beginning and 105.1MB in the end (delta: -34.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 132.1MB. Free memory was 105.1MB in the beginning and 103.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.18ms. Allocated memory is still 132.1MB. Free memory was 103.3MB in the beginning and 102.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.00ms. Allocated memory is still 132.1MB. Free memory was 102.0MB in the beginning and 90.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2421.93ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 89.9MB in the beginning and 130.5MB in the end (delta: -40.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: transformation to positive normal form unsound de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: transformation to positive normal form unsound: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:26:06,405 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 -ea -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/array-cav19/array_tiling_poly6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26ad3956041b2e839611ff318d272e1f932670752c1f7180f45920516dc03b70 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:26:08,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:26:08,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:26:08,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:26:08,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:26:08,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:26:08,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:26:08,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:26:08,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:26:08,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:26:08,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:26:08,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:26:08,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:26:08,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:26:08,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:26:08,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:26:08,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:26:08,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:26:08,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:26:08,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:26:08,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:26:08,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:26:08,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:26:08,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:26:08,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:26:08,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:26:08,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:26:08,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:26:08,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:26:08,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:26:08,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:26:08,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:26:08,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:26:08,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:26:08,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:26:08,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:26:08,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:26:08,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:26:08,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:26:08,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:26:08,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:26:08,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 14:26:08,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:26:08,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:26:08,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:26:08,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:26:08,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:26:08,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:26:08,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:26:08,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:26:08,172 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:26:08,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:26:08,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:26:08,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:26:08,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 14:26:08,174 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 14:26:08,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:26:08,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:26:08,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:26:08,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:26:08,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:26:08,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:26:08,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:26:08,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:08,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:26:08,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:26:08,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:26:08,176 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 14:26:08,177 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26ad3956041b2e839611ff318d272e1f932670752c1f7180f45920516dc03b70 [2022-02-20 14:26:08,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:26:08,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:26:08,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:26:08,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:26:08,408 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:26:08,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2022-02-20 14:26:08,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea8b6250/35aedd0b163948799cf5c6afdd81a1a1/FLAG9f0517ce2 [2022-02-20 14:26:08,818 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:26:08,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c [2022-02-20 14:26:08,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea8b6250/35aedd0b163948799cf5c6afdd81a1a1/FLAG9f0517ce2 [2022-02-20 14:26:09,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ea8b6250/35aedd0b163948799cf5c6afdd81a1a1 [2022-02-20 14:26:09,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:26:09,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:26:09,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:09,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:26:09,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:26:09,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c8332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09, skipping insertion in model container [2022-02-20 14:26:09,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:26:09,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:26:09,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] [2022-02-20 14:26:09,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:09,414 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:26:09,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_poly6.c[409,422] [2022-02-20 14:26:09,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:26:09,483 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:26:09,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09 WrapperNode [2022-02-20 14:26:09,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:26:09,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:09,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:26:09,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:26:09,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,529 INFO L137 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2022-02-20 14:26:09,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:26:09,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:26:09,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:26:09,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:26:09,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:26:09,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:26:09,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:26:09,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:26:09,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (1/1) ... [2022-02-20 14:26:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:26:09,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:26:09,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:26:09,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:26:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:26:09,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 14:26:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:26:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 14:26:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:26:09,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:26:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 14:26:09,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:26:09,686 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:26:09,688 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:26:10,033 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:26:10,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:26:10,037 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:26:10,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:10 BoogieIcfgContainer [2022-02-20 14:26:10,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:26:10,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:26:10,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:26:10,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:26:10,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:26:09" (1/3) ... [2022-02-20 14:26:10,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e551c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:10, skipping insertion in model container [2022-02-20 14:26:10,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:26:09" (2/3) ... [2022-02-20 14:26:10,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e551c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:26:10, skipping insertion in model container [2022-02-20 14:26:10,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:26:10" (3/3) ... [2022-02-20 14:26:10,057 INFO L111 eAbstractionObserver]: Analyzing ICFG array_tiling_poly6.c [2022-02-20 14:26:10,061 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:26:10,061 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:26:10,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:26:10,107 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:26:10,108 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:26:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:26:10,121 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:10,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:10,123 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -56209308, now seen corresponding path program 1 times [2022-02-20 14:26:10,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:10,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275010899] [2022-02-20 14:26:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:10,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:10,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:10,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:10,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 14:26:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 14:26:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:10,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {23#true} is VALID [2022-02-20 14:26:10,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {23#true} is VALID [2022-02-20 14:26:10,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {24#false} is VALID [2022-02-20 14:26:10,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv64; {24#false} is VALID [2022-02-20 14:26:10,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 14:26:10,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} main_~i~0#1 := 0bv64; {24#false} is VALID [2022-02-20 14:26:10,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 14:26:10,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} main_~i~0#1 := 0bv64; {24#false} is VALID [2022-02-20 14:26:10,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 18446744073709551615bv64 == main_#t~mem9#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {24#false} is VALID [2022-02-20 14:26:10,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {24#false} is VALID [2022-02-20 14:26:10,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 14:26:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:10,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:10,293 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:10,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275010899] [2022-02-20 14:26:10,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275010899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:10,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:10,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:26:10,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252047672] [2022-02-20 14:26:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:10,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) Word has length 11 [2022-02-20 14:26:10,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:10,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:10,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:26:10,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:26:10,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:10,350 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,459 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 14:26:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:26:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) Word has length 11 [2022-02-20 14:26:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 14:26:10,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 14:26:10,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:10,621 INFO L225 Difference]: With dead ends: 37 [2022-02-20 14:26:10,621 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 14:26:10,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:26:10,625 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:10,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:26:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 14:26:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 14:26:10,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:10,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,649 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,649 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,651 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:26:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:10,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:10,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:10,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:10,652 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 14:26:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:10,653 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 14:26:10,653 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:10,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:10,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:10,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:10,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:10,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-20 14:26:10,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-02-20 14:26:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:10,663 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-20 14:26:10,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-20 14:26:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 14:26:10,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:10,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:10,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:26:10,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:10,865 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -411746854, now seen corresponding path program 1 times [2022-02-20 14:26:10,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:10,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289233224] [2022-02-20 14:26:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:10,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:10,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:10,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:10,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 14:26:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:26:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:11,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {153#true} is VALID [2022-02-20 14:26:11,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {161#(or (and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)))))} is VALID [2022-02-20 14:26:11,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#(or (and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond#1); {165#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:11,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {165#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv64; {169#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} is VALID [2022-02-20 14:26:11,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {154#false} is VALID [2022-02-20 14:26:11,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#false} main_~i~0#1 := 0bv64; {154#false} is VALID [2022-02-20 14:26:11,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#false} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {154#false} is VALID [2022-02-20 14:26:11,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#false} main_~i~0#1 := 0bv64; {154#false} is VALID [2022-02-20 14:26:11,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 18446744073709551615bv64 == main_#t~mem9#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {154#false} is VALID [2022-02-20 14:26:11,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {154#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {154#false} is VALID [2022-02-20 14:26:11,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#false} assume !false; {154#false} is VALID [2022-02-20 14:26:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:11,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:26:11,095 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:11,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289233224] [2022-02-20 14:26:11,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289233224] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:26:11,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:26:11,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:26:11,097 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549427691] [2022-02-20 14:26:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:26:11,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 11 [2022-02-20 14:26:11,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:11,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:11,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:26:11,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:11,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:26:11,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:26:11,115 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,444 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 14:26:11,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:26:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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) Word has length 11 [2022-02-20 14:26:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 14:26:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 14:26:11,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 14:26:11,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:11,626 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:26:11,626 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 14:26:11,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:26:11,627 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:11,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:26:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 14:26:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2022-02-20 14:26:11,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:11,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,630 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,631 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,632 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:11,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:11,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:11,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-02-20 14:26:11,633 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 26 states. [2022-02-20 14:26:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:11,643 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-02-20 14:26:11,643 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 14:26:11,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:11,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:11,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:11,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-20 14:26:11,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-02-20 14:26:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:11,645 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-20 14:26:11,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-20 14:26:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:26:11,645 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:11,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:11,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 14:26:11,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:11,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash 467501014, now seen corresponding path program 1 times [2022-02-20 14:26:11,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:11,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449078825] [2022-02-20 14:26:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:26:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:11,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:11,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 14:26:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:26:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:12,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {313#true} is VALID [2022-02-20 14:26:12,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {321#(or (and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)))))} is VALID [2022-02-20 14:26:12,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {321#(or (and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond#1); {325#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:12,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {325#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv64; {329#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} is VALID [2022-02-20 14:26:12,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call write~intINTTYPE8(~bvmul64(~bvsub64(main_~i~0#1, 1bv64), ~bvadd64(1bv64, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32); {329#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} is VALID [2022-02-20 14:26:12,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {329#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post5#1);havoc main_#t~post5#1; {336#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 64)))} is VALID [2022-02-20 14:26:12,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(and (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv1 64)))} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {314#false} is VALID [2022-02-20 14:26:12,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#false} main_~i~0#1 := 0bv64; {314#false} is VALID [2022-02-20 14:26:12,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem7#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);call write~intINTTYPE8(~bvsub64(main_#t~mem7#1, ~bvmul64(main_~i~0#1, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);havoc main_#t~mem7#1; {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post6#1);havoc main_#t~post6#1; {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} main_~i~0#1 := 0bv64; {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 18446744073709551615bv64 == main_#t~mem9#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {314#false} is VALID [2022-02-20 14:26:12,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 14:26:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:12,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {314#false} is VALID [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 18446744073709551615bv64 == main_#t~mem9#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {314#false} is VALID [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} main_~i~0#1 := 0bv64; {314#false} is VALID [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {314#false} is VALID [2022-02-20 14:26:12,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#false} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post6#1);havoc main_#t~post6#1; {314#false} is VALID [2022-02-20 14:26:12,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#false} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem7#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);call write~intINTTYPE8(~bvsub64(main_#t~mem7#1, ~bvmul64(main_~i~0#1, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);havoc main_#t~mem7#1; {314#false} is VALID [2022-02-20 14:26:12,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#false} main_~i~0#1 := 0bv64; {314#false} is VALID [2022-02-20 14:26:12,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {388#(bvslt |ULTIMATE.start_main_~i~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {314#false} is VALID [2022-02-20 14:26:12,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post5#1);havoc main_#t~post5#1; {388#(bvslt |ULTIMATE.start_main_~i~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:12,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call write~intINTTYPE8(~bvmul64(~bvsub64(main_~i~0#1, 1bv64), ~bvadd64(1bv64, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32); {392#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:12,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {325#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv64; {392#(bvslt (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) ((_ sign_extend 32) |ULTIMATE.start_main_~S~0#1|))} is VALID [2022-02-20 14:26:12,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#(or (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond#1); {325#(bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32))} is VALID [2022-02-20 14:26:12,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {402#(or (bvsgt |ULTIMATE.start_main_~S~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))} is VALID [2022-02-20 14:26:12,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {313#true} is VALID [2022-02-20 14:26:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:26:12,256 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 14:26:12,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449078825] [2022-02-20 14:26:12,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449078825] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:26:12,256 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:26:12,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-02-20 14:26:12,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765373460] [2022-02-20 14:26:12,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:26:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 15 [2022-02-20 14:26:12,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:26:12,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:12,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:12,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:26:12,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 14:26:12,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:26:12,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:26:12,362 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:13,071 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-02-20 14:26:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:26:13,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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 15 [2022-02-20 14:26:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:26:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:26:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-02-20 14:26:13,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-02-20 14:26:13,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:26:13,315 INFO L225 Difference]: With dead ends: 47 [2022-02-20 14:26:13,315 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:26:13,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:26:13,316 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:26:13,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 31 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 14:26:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:26:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2022-02-20 14:26:13,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:26:13,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:13,319 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:13,319 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:13,320 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 14:26:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 14:26:13,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:13,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:13,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) Second operand 36 states. [2022-02-20 14:26:13,321 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) Second operand 36 states. [2022-02-20 14:26:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:26:13,326 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-02-20 14:26:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-20 14:26:13,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:26:13,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:26:13,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:26:13,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:26:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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) [2022-02-20 14:26:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-02-20 14:26:13,327 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-02-20 14:26:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:26:13,328 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-02-20 14:26:13,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:26:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-02-20 14:26:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:26:13,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:26:13,328 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:26:13,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 14:26:13,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 14:26:13,529 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:26:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:26:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1570853842, now seen corresponding path program 2 times [2022-02-20 14:26:13,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 14:26:13,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787794828] [2022-02-20 14:26:13,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:26:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 14:26:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 14:26:13,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 14:26:13,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 14:26:13,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:26:13,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:26:13,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 14:26:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:26:13,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:26:13,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:26:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:13,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-02-20 14:26:14,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:14,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2022-02-20 14:26:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:14,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 62 [2022-02-20 14:26:14,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:26:14,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:14,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2022-02-20 14:26:14,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:26:14,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 27 [2022-02-20 14:26:14,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {576#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {576#true} is VALID [2022-02-20 14:26:14,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {576#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~S~0#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;main_~S~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsgt32(main_~S~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {576#true} is VALID [2022-02-20 14:26:14,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#true} assume !(0bv32 == assume_abort_if_not_~cond#1); {576#true} is VALID [2022-02-20 14:26:14,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {576#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(~bvmul32(8bv32, main_~S~0#1));main_~i~0#1 := 0bv64; {590#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {590#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call write~intINTTYPE8(~bvmul64(~bvsub64(main_~i~0#1, 1bv64), ~bvadd64(1bv64, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32); {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post5#1);havoc main_#t~post5#1; {598#(and (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))) (= ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {598#(and (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))) (= ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call write~intINTTYPE8(~bvmul64(~bvsub64(main_~i~0#1, 1bv64), ~bvadd64(1bv64, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32); {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post5#1);havoc main_#t~post5#1; {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_~i~0#1 := 0bv64; {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem7#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);call write~intINTTYPE8(~bvsub64(main_#t~mem7#1, ~bvmul64(main_~i~0#1, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);havoc main_#t~mem7#1; {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post6#1);havoc main_#t~post6#1; {598#(and (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))) (= ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(and (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= (_ bv0 64) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))) (= ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551614 64)) |ULTIMATE.start_main_~i~0#1|)) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd |ULTIMATE.start_main_~#a~0#1.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem7#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);call write~intINTTYPE8(~bvsub64(main_#t~mem7#1, ~bvmul64(main_~i~0#1, main_~i~0#1)), main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);havoc main_#t~mem7#1; {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := ~bvadd64(1bv64, main_#t~post6#1);havoc main_#t~post6#1; {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1)); {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {602#(and (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (= (_ bv4294967295 32) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} main_~i~0#1 := 0bv64; {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 14:26:15,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 64)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|)) ((_ extract 31 0) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64))))) (= ((_ extract 63 32) (bvmul (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 64)) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv18446744073709551615 64)))) (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (bvadd (_ bv4 32) (bvmul ((_ extract 31 0) |ULTIMATE.start_main_~i~0#1|) (_ bv8 32)) |ULTIMATE.start_main_~#a~0#1.offset|))) (= |ULTIMATE.start_main_~#a~0#1.offset| (_ bv0 32)))} assume !!~bvslt64(main_~i~0#1, ~sign_extendFrom32To64(main_~S~0#1));call main_#t~mem9#1 := read~intINTTYPE8(main_~#a~0#1.base, ~bvadd32(main_~#a~0#1.offset, ~bvmul32(8bv32, main_~i~0#1[32:0])), 8bv32);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 18446744073709551615bv64 == main_#t~mem9#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {633#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 14:26:15,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {633#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {577#false} is VALID [2022-02-20 14:26:15,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {577#false} assume !false; {577#false} is VALID [2022-02-20 14:26:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:26:15,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:26:19,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 115 [2022-02-20 14:26:19,938 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 14:26:19,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295738 treesize of output 292666