./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn4.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-fpi/ifeqn4.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 b0db5597ff96f0e5a728327333d32dd7df56f4b1fb643f99ebf0f69cacecd717 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:29:21,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:29:21,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:29:21,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:29:21,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:29:21,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:29:21,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:29:21,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:29:21,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:29:21,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:29:21,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:29:21,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:29:21,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:29:21,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:29:21,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:29:21,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:29:21,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:29:21,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:29:21,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:29:21,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:29:21,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:29:21,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:29:21,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:29:21,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:29:21,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:29:21,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:29:21,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:29:21,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:29:21,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:29:21,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:29:21,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:29:21,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:29:21,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:29:21,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:29:21,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:29:21,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:29:21,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:29:21,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:29:21,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:29:21,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:29:21,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:29:21,238 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:29:21,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:29:21,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:29:21,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:29:21,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:29:21,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:29:21,266 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:29:21,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:29:21,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:29:21,267 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:29:21,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:29:21,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:29:21,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:29:21,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:29:21,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:29:21,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:29:21,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:29:21,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:29:21,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:29:21,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:29:21,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:29:21,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:29:21,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:29:21,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:29:21,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:29:21,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:21,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:29:21,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:29:21,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:29:21,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:29:21,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:29:21,272 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:29:21,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:29:21,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:29:21,273 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 -> b0db5597ff96f0e5a728327333d32dd7df56f4b1fb643f99ebf0f69cacecd717 [2022-02-20 14:29:21,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:29:21,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:29:21,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:29:21,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:29:21,531 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:29:21,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn4.c [2022-02-20 14:29:21,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86bd7adc/5aa164262fa44c8ab30153f7496daef5/FLAG9fc5ce243 [2022-02-20 14:29:21,972 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:29:21,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn4.c [2022-02-20 14:29:21,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86bd7adc/5aa164262fa44c8ab30153f7496daef5/FLAG9fc5ce243 [2022-02-20 14:29:21,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86bd7adc/5aa164262fa44c8ab30153f7496daef5 [2022-02-20 14:29:21,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:29:21,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:29:21,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:21,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:29:22,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:29:22,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:21" (1/1) ... [2022-02-20 14:29:22,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8bcb044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22, skipping insertion in model container [2022-02-20 14:29:22,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:21" (1/1) ... [2022-02-20 14:29:22,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:29:22,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:29:22,205 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-fpi/ifeqn4.c[589,602] [2022-02-20 14:29:22,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:22,246 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:29:22,256 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-fpi/ifeqn4.c[589,602] [2022-02-20 14:29:22,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:22,285 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:29:22,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22 WrapperNode [2022-02-20 14:29:22,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:22,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:22,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:29:22,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:29:22,294 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:29:22" (1/1) ... [2022-02-20 14:29:22,307 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:29:22" (1/1) ... [2022-02-20 14:29:22,340 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-02-20 14:29:22,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:22,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:29:22,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:29:22,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:29:22,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:29:22,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:29:22,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:29:22,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:29:22,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (1/1) ... [2022-02-20 14:29:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:22,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:22,441 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:29:22,463 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:29:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:29:22,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:29:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:29:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:29:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:29:22,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:29:22,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:29:22,544 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:29:22,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:29:22,726 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:29:22,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:29:22,732 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:29:22,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:22 BoogieIcfgContainer [2022-02-20 14:29:22,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:29:22,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:29:22,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:29:22,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:29:22,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:29:21" (1/3) ... [2022-02-20 14:29:22,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cd105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:22, skipping insertion in model container [2022-02-20 14:29:22,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:22" (2/3) ... [2022-02-20 14:29:22,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19cd105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:22, skipping insertion in model container [2022-02-20 14:29:22,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:22" (3/3) ... [2022-02-20 14:29:22,741 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn4.c [2022-02-20 14:29:22,746 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:29:22,746 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:29:22,800 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:29:22,828 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:29:22,828 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:29:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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:29:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:22,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:22,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:22,877 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:22,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-02-20 14:29:22,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:22,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167828697] [2022-02-20 14:29:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:23,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {26#true} is VALID [2022-02-20 14:29:23,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {26#true} is VALID [2022-02-20 14:29:23,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 14:29:23,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 14:29:23,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:23,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume !(main_~i~0#1 < ~N~0); {27#false} is VALID [2022-02-20 14:29:23,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:23,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:29:23,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:23,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {27#false} is VALID [2022-02-20 14:29:23,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:29:23,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:29:23,098 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:29:23,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:23,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167828697] [2022-02-20 14:29:23,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167828697] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:23,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:23,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:29:23,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356879198] [2022-02-20 14:29:23,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:23,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:23,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:23,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:29:23,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:29:23,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:29:23,206 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,263 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-02-20 14:29:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:29:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:23,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 14:29:23,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:23,383 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:29:23,384 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:29:23,387 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:29:23,390 INFO L933 BasicCegarLoop]: 28 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, 28 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:29:23,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:29:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:29:23,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:23,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,422 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,422 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,424 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:23,426 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:23,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:29:23,427 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:29:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,432 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:23,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:23,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:29:23,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-02-20 14:29:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:23,439 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:29:23,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:23,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:23,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:23,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:29:23,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-02-20 14:29:23,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:23,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38743064] [2022-02-20 14:29:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:23,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {140#true} is VALID [2022-02-20 14:29:23,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {140#true} is VALID [2022-02-20 14:29:23,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {142#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:23,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {142#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:23,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:29:23,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {141#false} is VALID [2022-02-20 14:29:23,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:23,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#false} assume !(main_~i~0#1 < ~N~0); {141#false} is VALID [2022-02-20 14:29:23,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:23,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {141#false} is VALID [2022-02-20 14:29:23,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond#1; {141#false} is VALID [2022-02-20 14:29:23,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 14:29:23,559 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:29:23,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:23,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38743064] [2022-02-20 14:29:23,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38743064] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:23,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:23,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:29:23,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526339703] [2022-02-20 14:29:23,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:23,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:23,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:23,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:29:23,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:23,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:29:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:23,577 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,705 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:29:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:29:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:23,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 14:29:23,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:23,769 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:29:23,769 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:29:23,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:23,776 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:23,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:29:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-02-20 14:29:23,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:23,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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:29:23,799 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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:29:23,800 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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:29:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,802 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:23,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 31 states. [2022-02-20 14:29:23,805 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 31 states. [2022-02-20 14:29:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,808 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:23,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:23,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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:29:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:29:23,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-02-20 14:29:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:23,812 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:29:23,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:29:23,815 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:23,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:23,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:29:23,816 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-02-20 14:29:23,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:23,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833139071] [2022-02-20 14:29:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:23,869 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:23,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404282913] [2022-02-20 14:29:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:23,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:23,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:23,876 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:29:23,878 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:29:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:23,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:29:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:23,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:24,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 14:29:24,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {290#true} is VALID [2022-02-20 14:29:24,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {290#true} is VALID [2022-02-20 14:29:24,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {290#true} is VALID [2022-02-20 14:29:24,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {290#true} assume !(0 == assume_abort_if_not_~cond#1); {290#true} is VALID [2022-02-20 14:29:24,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {290#true} is VALID [2022-02-20 14:29:24,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:24,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#true} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {290#true} is VALID [2022-02-20 14:29:24,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {290#true} is VALID [2022-02-20 14:29:24,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#true} assume !(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:24,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#true} main_~i~0#1 := 0; {290#true} is VALID [2022-02-20 14:29:24,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:24,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {290#true} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:24,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:24,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:24,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:24,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {342#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:24,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {291#false} is VALID [2022-02-20 14:29:24,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-02-20 14:29:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:29:24,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:24,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:24,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833139071] [2022-02-20 14:29:24,258 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:24,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404282913] [2022-02-20 14:29:24,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404282913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:24,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:24,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:24,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731232071] [2022-02-20 14:29:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:29:24,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:24,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:29:24,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:24,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:24,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:24,291 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:29:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:24,513 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 14:29:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:29:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:29:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:29:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:29:24,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:24,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 14:29:24,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:24,564 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:29:24,564 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:29:24,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:29:24,565 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:24,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:29:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 14:29:24,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:24,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:29:24,580 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:29:24,580 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:29:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:24,586 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:24,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:24,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:24,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 38 states. [2022-02-20 14:29:24,587 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 38 states. [2022-02-20 14:29:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:24,588 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:24,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:24,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:24,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:24,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:29:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 14:29:24,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-02-20 14:29:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:24,591 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 14:29:24,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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:29:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 14:29:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:29:24,599 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:24,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:24,626 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:29:24,822 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:29:24,823 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-02-20 14:29:24,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:24,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194164829] [2022-02-20 14:29:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:24,863 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:24,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398445117] [2022-02-20 14:29:24,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:24,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:24,872 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:29:24,873 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:29:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:24,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:29:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:24,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:25,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {512#true} is VALID [2022-02-20 14:29:25,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {512#true} is VALID [2022-02-20 14:29:25,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {512#true} is VALID [2022-02-20 14:29:25,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume !(0 == assume_abort_if_not_~cond#1); {512#true} is VALID [2022-02-20 14:29:25,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:25,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {543#(<= ~N~0 1)} is VALID [2022-02-20 14:29:25,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(<= ~N~0 1)} main_~i~0#1 := 0; {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:25,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0); {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:25,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:25,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {557#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:25,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:25,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {513#false} is VALID [2022-02-20 14:29:25,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {513#false} is VALID [2022-02-20 14:29:25,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:25,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:25,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {513#false} is VALID [2022-02-20 14:29:25,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:25,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:25,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:25,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:25,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:25,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {513#false} is VALID [2022-02-20 14:29:25,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:25,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:25,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {513#false} is VALID [2022-02-20 14:29:25,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {513#false} is VALID [2022-02-20 14:29:25,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:25,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {603#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:25,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:25,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:25,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(<= ~N~0 1)} main_~i~0#1 := 0; {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:25,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {543#(<= ~N~0 1)} is VALID [2022-02-20 14:29:25,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:25,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:25,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume !(0 == assume_abort_if_not_~cond#1); {512#true} is VALID [2022-02-20 14:29:25,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {512#true} is VALID [2022-02-20 14:29:25,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {512#true} is VALID [2022-02-20 14:29:25,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {512#true} is VALID [2022-02-20 14:29:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:25,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:25,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194164829] [2022-02-20 14:29:25,264 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:25,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398445117] [2022-02-20 14:29:25,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398445117] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:25,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:25,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:29:25,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174203191] [2022-02-20 14:29:25,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:29:25,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:25,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:29:25,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:25,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:29:25,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:29:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:29:25,294 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:29:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:25,623 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-02-20 14:29:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:29:25,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:29:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:29:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:29:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:25,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-02-20 14:29:25,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:25,682 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:29:25,682 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 14:29:25,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:25,684 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:25,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 14:29:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-02-20 14:29:25,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:29:25,695 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:29:25,695 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:29:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:25,696 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:25,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:25,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:25,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 43 states. [2022-02-20 14:29:25,697 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 43 states. [2022-02-20 14:29:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:25,699 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:25,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:25,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:25,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:25,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:29:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 14:29:25,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-02-20 14:29:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:25,700 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 14:29:25,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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:29:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:29:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:29:25,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:25,701 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:25,720 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:29:25,911 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:29:25,912 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-02-20 14:29:25,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:25,912 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631898517] [2022-02-20 14:29:25,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:25,958 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:25,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1405236872] [2022-02-20 14:29:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:25,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:25,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:25,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:29:25,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:29:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:26,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 14:29:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:26,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:26,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 14:29:26,201 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 14:29:26,201 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:29:26,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {856#true} is VALID [2022-02-20 14:29:26,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {856#true} is VALID [2022-02-20 14:29:26,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {856#true} is VALID [2022-02-20 14:29:26,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#true} assume !(0 == assume_abort_if_not_~cond#1); {856#true} is VALID [2022-02-20 14:29:26,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:26,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:26,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:26,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:26,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:26,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {856#true} is VALID [2022-02-20 14:29:26,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:26,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:26,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#true} main_~i~0#1 := 0; {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:26,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:26,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:26,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:26,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0); {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:26,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:26,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:26,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:29:26,326 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:29:26,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:26,726 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 21 treesize of output 19 [2022-02-20 14:29:26,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:26,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:29:26,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {941#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:26,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {941#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:26,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:26,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} assume !!(main_~i~0#1 < ~N~0); {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:26,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {961#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:26,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {961#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:26,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} assume !!(main_~i~0#1 < ~N~0); {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} is VALID [2022-02-20 14:29:26,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#true} main_~i~0#1 := 0; {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} is VALID [2022-02-20 14:29:26,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:26,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:26,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {856#true} is VALID [2022-02-20 14:29:26,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:26,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:26,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {856#true} is VALID [2022-02-20 14:29:26,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:26,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {856#true} is VALID [2022-02-20 14:29:26,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#true} assume !(0 == assume_abort_if_not_~cond#1); {856#true} is VALID [2022-02-20 14:29:26,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {856#true} is VALID [2022-02-20 14:29:26,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {856#true} is VALID [2022-02-20 14:29:26,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {856#true} is VALID [2022-02-20 14:29:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:26,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:26,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631898517] [2022-02-20 14:29:26,811 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:26,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405236872] [2022-02-20 14:29:26,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405236872] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:26,814 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:26,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-02-20 14:29:26,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361034884] [2022-02-20 14:29:26,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:26,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:29:26,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:26,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:29:26,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:26,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:29:26,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:26,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:29:26,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:29:26,871 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:29:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,308 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 14:29:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:29:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:29:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:29:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:29:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:27,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2022-02-20 14:29:27,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:27,391 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:29:27,391 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 14:29:27,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:29:27,392 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:27,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-02-20 14:29:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 14:29:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-02-20 14:29:27,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:27,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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:29:27,410 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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:29:27,410 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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:29:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,412 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:27,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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 61 states. [2022-02-20 14:29:27,413 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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 61 states. [2022-02-20 14:29:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,415 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:27,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:27,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 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:29:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 14:29:27,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-02-20 14:29:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:27,418 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 14:29:27,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 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:29:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 14:29:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:29:27,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:27,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:27,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:27,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:27,648 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-02-20 14:29:27,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:27,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255378405] [2022-02-20 14:29:27,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:27,681 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:27,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795773314] [2022-02-20 14:29:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:27,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:27,682 INFO L229 MonitoredProcess]: Starting monitored process 5 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:29:27,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:29:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:27,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 14:29:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:27,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:27,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-02-20 14:29:27,885 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 11 treesize of output 7 [2022-02-20 14:29:27,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:27,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:29:28,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 14:29:28,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:28,191 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:29:28,191 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 38 treesize of output 32 [2022-02-20 14:29:28,719 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:29:28,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-02-20 14:29:28,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1274#true} is VALID [2022-02-20 14:29:28,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1274#true} is VALID [2022-02-20 14:29:28,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {1274#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1274#true} is VALID [2022-02-20 14:29:28,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {1274#true} assume !(0 == assume_abort_if_not_~cond#1); {1274#true} is VALID [2022-02-20 14:29:28,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(main_~i~0#1 < ~N~0); {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~i~0#1 := 0; {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:28,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1325#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(main_~i~0#1 < ~N~0); {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_~i~0#1 := 0; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1359#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:28,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {1359#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 8) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:28,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1275#false} is VALID [2022-02-20 14:29:28,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:28,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:29,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:29,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1275#false} is VALID [2022-02-20 14:29:29,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:29,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1376#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))) (+ (* |ULTIMATE.start_main_~i~0#1| 4) (* |ULTIMATE.start_main_~i~0#1| (* |ULTIMATE.start_main_~i~0#1| 4)) 1)) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:29,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:29,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} assume !(0 == __VERIFIER_assert_~cond#1); {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:29,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:29,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} main_~i~0#1 := 0; {1380#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4)))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ 5 (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ (* |ULTIMATE.start_main_~i~0#1| 4) 4)) (* |ULTIMATE.start_main_~i~0#1| 4))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:29,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !(main_~i~0#1 < ~N~0); {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:29,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:29,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1403#(= 9 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {1393#(= 9 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:29,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {1403#(= 9 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0); {1403#(= 9 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:29,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1403#(= 9 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:29,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1410#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} is VALID [2022-02-20 14:29:29,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} assume !!(main_~i~0#1 < ~N~0); {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} is VALID [2022-02-20 14:29:29,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} main_~i~0#1 := 0; {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 9)} is VALID [2022-02-20 14:29:29,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} assume !(main_~i~0#1 < ~N~0); {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} is VALID [2022-02-20 14:29:29,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} is VALID [2022-02-20 14:29:29,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#(forall ((v_ArrVal_112 Int)) (= 8 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 9)} is VALID [2022-02-20 14:29:29,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(forall ((v_ArrVal_112 Int)) (= 8 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0); {1431#(forall ((v_ArrVal_112 Int)) (= 8 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-20 14:29:29,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1431#(forall ((v_ArrVal_112 Int)) (= 8 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-20 14:29:29,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {1438#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 8))} is VALID [2022-02-20 14:29:29,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} assume !!(main_~i~0#1 < ~N~0); {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} is VALID [2022-02-20 14:29:29,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} is VALID [2022-02-20 14:29:29,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {1274#true} assume !(0 == assume_abort_if_not_~cond#1); {1274#true} is VALID [2022-02-20 14:29:29,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1274#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1274#true} is VALID [2022-02-20 14:29:29,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1274#true} is VALID [2022-02-20 14:29:29,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1274#true} is VALID [2022-02-20 14:29:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:29,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:29,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255378405] [2022-02-20 14:29:29,878 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:29,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795773314] [2022-02-20 14:29:29,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795773314] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:29,878 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:29,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-02-20 14:29:29,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046538018] [2022-02-20 14:29:29,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:29:29,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:29,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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:29:29,988 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:29:29,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:29:29,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:29,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:29:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:29:29,989 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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:29:40,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-02-20 14:29:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:40,949 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-02-20 14:29:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-20 14:29:40,950 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:29:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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:29:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2022-02-20 14:29:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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:29:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2022-02-20 14:29:40,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 98 transitions. [2022-02-20 14:29:41,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:41,304 INFO L225 Difference]: With dead ends: 115 [2022-02-20 14:29:41,304 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 14:29:41,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2022-02-20 14:29:41,305 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:41,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 81 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 161 Invalid, 1 Unknown, 78 Unchecked, 9.7s Time] [2022-02-20 14:29:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 14:29:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-02-20 14:29:41,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:41,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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:29:41,343 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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:29:41,343 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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:29:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:41,345 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-02-20 14:29:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-02-20 14:29:41,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:41,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:41,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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 84 states. [2022-02-20 14:29:41,346 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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 84 states. [2022-02-20 14:29:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:41,349 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-02-20 14:29:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2022-02-20 14:29:41,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:41,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:41,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:41,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 72 states have internal predecessors, (88), 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:29:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-02-20 14:29:41,352 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 28 [2022-02-20 14:29:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:41,352 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-02-20 14:29:41,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 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:29:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-02-20 14:29:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:41,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:41,353 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:41,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:41,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:41,563 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-02-20 14:29:41,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:41,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364930622] [2022-02-20 14:29:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:41,591 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:41,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760666489] [2022-02-20 14:29:41,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:41,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:41,593 INFO L229 MonitoredProcess]: Starting monitored process 6 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:29:41,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 14:29:41,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:41,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:41,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:29:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:41,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:41,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {1898#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1898#true} is VALID [2022-02-20 14:29:41,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1898#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1898#true} is VALID [2022-02-20 14:29:41,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {1898#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1898#true} is VALID [2022-02-20 14:29:41,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {1898#true} assume !(0 == assume_abort_if_not_~cond#1); {1898#true} is VALID [2022-02-20 14:29:41,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {1898#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1898#true} is VALID [2022-02-20 14:29:41,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {1898#true} assume !!(main_~i~0#1 < ~N~0); {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {1898#true} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {1898#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {1898#true} assume !!(main_~i~0#1 < ~N~0); {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {1898#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {1898#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1898#true} is VALID [2022-02-20 14:29:41,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {1898#true} assume !(main_~i~0#1 < ~N~0); {1898#true} is VALID [2022-02-20 14:29:41,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#true} main_~i~0#1 := 0; {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {1939#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {1949#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1959#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {1959#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1959#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {1959#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1899#false} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {1899#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1899#false} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {1899#false} assume !!(main_~i~0#1 < ~N~0); {1899#false} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {1899#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {1899#false} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {1899#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1899#false} is VALID [2022-02-20 14:29:41,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {1899#false} assume !(main_~i~0#1 < ~N~0); {1899#false} is VALID [2022-02-20 14:29:41,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {1899#false} main_~i~0#1 := 0; {1899#false} is VALID [2022-02-20 14:29:41,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {1899#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1899#false} is VALID [2022-02-20 14:29:41,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {1899#false} assume 0 == __VERIFIER_assert_~cond#1; {1899#false} is VALID [2022-02-20 14:29:41,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2022-02-20 14:29:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:41,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:41,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:41,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364930622] [2022-02-20 14:29:41,794 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:41,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760666489] [2022-02-20 14:29:41,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760666489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:41,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:41,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:41,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245612851] [2022-02-20 14:29:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:41,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) Word has length 30 [2022-02-20 14:29:41,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:41,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:29:41,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:41,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:41,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:41,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:41,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:41,823 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:29:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:42,000 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2022-02-20 14:29:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:29:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) Word has length 30 [2022-02-20 14:29:42,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:29:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:29:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:42,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 14:29:42,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:42,058 INFO L225 Difference]: With dead ends: 129 [2022-02-20 14:29:42,058 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 14:29:42,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:42,059 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:42,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 14:29:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-02-20 14:29:42,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:42,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:42,101 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:42,101 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:42,103 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 14:29:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 14:29:42,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:42,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:42,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-20 14:29:42,104 INFO L87 Difference]: Start difference. First operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-20 14:29:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:42,106 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 14:29:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 14:29:42,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:42,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:42,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:42,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-02-20 14:29:42,108 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2022-02-20 14:29:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:42,109 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-02-20 14:29:42,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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:29:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-02-20 14:29:42,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:42,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:42,110 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:42,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:42,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:42,333 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-02-20 14:29:42,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:42,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628611605] [2022-02-20 14:29:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:42,364 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:42,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167793551] [2022-02-20 14:29:42,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:42,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:42,366 INFO L229 MonitoredProcess]: Starting monitored process 7 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:29:42,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 14:29:42,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:29:42,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:42,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:29:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:42,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:43,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {2406#true} is VALID [2022-02-20 14:29:43,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2406#true} is VALID [2022-02-20 14:29:43,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2417#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:43,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {2417#(not (<= ~N~0 0))} assume !(0 == assume_abort_if_not_~cond#1); {2417#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:43,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {2417#(not (<= ~N~0 0))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:43,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} assume !!(main_~i~0#1 < ~N~0); {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:43,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:43,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {2424#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:43,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:43,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:43,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {2434#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2444#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:43,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {2444#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (not (<= ~N~0 0)))} assume !(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_~i~0#1 := 0; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2476#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {2476#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2480#(and (not (<= ~N~0 0)) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {2480#(and (not (<= ~N~0 0)) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2484#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {2484#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2488#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {2488#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2484#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {2484#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} assume !(main_~i~0#1 < ~N~0); {2407#false} is VALID [2022-02-20 14:29:43,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {2407#false} main_~i~0#1 := 0; {2407#false} is VALID [2022-02-20 14:29:43,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {2407#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2407#false} is VALID [2022-02-20 14:29:43,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {2407#false} assume 0 == __VERIFIER_assert_~cond#1; {2407#false} is VALID [2022-02-20 14:29:43,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-02-20 14:29:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:43,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:43,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {2407#false} assume !false; {2407#false} is VALID [2022-02-20 14:29:43,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {2407#false} assume 0 == __VERIFIER_assert_~cond#1; {2407#false} is VALID [2022-02-20 14:29:43,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {2407#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2407#false} is VALID [2022-02-20 14:29:43,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {2407#false} main_~i~0#1 := 0; {2407#false} is VALID [2022-02-20 14:29:43,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {2519#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {2407#false} is VALID [2022-02-20 14:29:43,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {2523#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2519#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:29:43,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {2527#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2523#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:43,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {2531#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} assume !!(main_~i~0#1 < ~N~0); {2527#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:43,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {2535#(or (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2531#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} is VALID [2022-02-20 14:29:43,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2535#(or (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} is VALID [2022-02-20 14:29:43,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_~i~0#1 := 0; {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2566#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !(main_~i~0#1 < ~N~0); {2448#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:43,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2566#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:43,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:43,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:43,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2570#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:43,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:43,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:43,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {2417#(not (<= ~N~0 0))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {2580#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:43,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {2417#(not (<= ~N~0 0))} assume !(0 == assume_abort_if_not_~cond#1); {2417#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:43,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {2406#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2417#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:43,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {2406#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2406#true} is VALID [2022-02-20 14:29:43,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {2406#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {2406#true} is VALID [2022-02-20 14:29:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:43,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:43,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628611605] [2022-02-20 14:29:43,526 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:43,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167793551] [2022-02-20 14:29:43,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167793551] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:43,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:43,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2022-02-20 14:29:43,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606184123] [2022-02-20 14:29:43,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:43,528 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:43,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:43,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:43,566 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:29:43,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:29:43,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:29:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:29:43,567 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:44,354 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-02-20 14:29:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:29:44,355 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:44,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:44,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2022-02-20 14:29:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2022-02-20 14:29:44,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 91 transitions. [2022-02-20 14:29:44,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:44,444 INFO L225 Difference]: With dead ends: 116 [2022-02-20 14:29:44,444 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 14:29:44,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2022-02-20 14:29:44,445 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 108 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:44,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 79 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:29:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 14:29:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2022-02-20 14:29:44,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:44,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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:29:44,496 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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:29:44,497 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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:29:44,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:44,499 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-02-20 14:29:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-02-20 14:29:44,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:44,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:44,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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 96 states. [2022-02-20 14:29:44,500 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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 96 states. [2022-02-20 14:29:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:44,502 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-02-20 14:29:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-02-20 14:29:44,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:44,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:44,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:44,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 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:29:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-20 14:29:44,504 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2022-02-20 14:29:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:44,504 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-20 14:29:44,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 14:29:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 14:29:44,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:44,505 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:44,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:44,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:44,716 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 2 times [2022-02-20 14:29:44,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:44,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739867600] [2022-02-20 14:29:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:44,747 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:44,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560032324] [2022-02-20 14:29:44,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:44,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:44,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:44,752 INFO L229 MonitoredProcess]: Starting monitored process 8 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:29:44,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 14:29:44,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:44,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:44,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:29:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:44,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:45,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {3044#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3044#true} is VALID [2022-02-20 14:29:45,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3044#true} is VALID [2022-02-20 14:29:45,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3044#true} is VALID [2022-02-20 14:29:45,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {3044#true} assume !(0 == assume_abort_if_not_~cond#1); {3044#true} is VALID [2022-02-20 14:29:45,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {3044#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:45,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {3085#(<= ~N~0 2)} main_~i~0#1 := 0; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {3085#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {3085#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {3085#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {3085#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {3085#(<= ~N~0 2)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {3085#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {3085#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {3085#(<= ~N~0 2)} main_~i~0#1 := 0; {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {3113#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {3126#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3139#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:45,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {3139#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3045#false} is VALID [2022-02-20 14:29:45,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {3045#false} assume 0 == __VERIFIER_assert_~cond#1; {3045#false} is VALID [2022-02-20 14:29:45,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-02-20 14:29:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:45,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:45,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {3045#false} assume !false; {3045#false} is VALID [2022-02-20 14:29:45,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {3045#false} assume 0 == __VERIFIER_assert_~cond#1; {3045#false} is VALID [2022-02-20 14:29:45,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {3155#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3045#false} is VALID [2022-02-20 14:29:45,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3155#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:45,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:45,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:45,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:45,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3159#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:45,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:45,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:45,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:45,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {3085#(<= ~N~0 2)} main_~i~0#1 := 0; {3172#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:45,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {3085#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {3085#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {3085#(<= ~N~0 2)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3085#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3085#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {3085#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {3085#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {3085#(<= ~N~0 2)} main_~i~0#1 := 0; {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {3081#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3085#(<= ~N~0 2)} is VALID [2022-02-20 14:29:45,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3081#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:45,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3071#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:45,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {3044#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3061#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:45,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {3044#true} assume !(0 == assume_abort_if_not_~cond#1); {3044#true} is VALID [2022-02-20 14:29:45,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {3044#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3044#true} is VALID [2022-02-20 14:29:45,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {3044#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3044#true} is VALID [2022-02-20 14:29:45,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {3044#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3044#true} is VALID [2022-02-20 14:29:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:45,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:45,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739867600] [2022-02-20 14:29:45,266 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:45,266 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560032324] [2022-02-20 14:29:45,266 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560032324] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:45,266 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:45,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:29:45,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711815845] [2022-02-20 14:29:45,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:45,269 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 32 [2022-02-20 14:29:45,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:45,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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:29:45,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:45,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:29:45,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:29:45,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:45,311 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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:29:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:45,755 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-02-20 14:29:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:29:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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 32 [2022-02-20 14:29:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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:29:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-02-20 14:29:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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:29:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-02-20 14:29:45,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2022-02-20 14:29:45,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:45,844 INFO L225 Difference]: With dead ends: 102 [2022-02-20 14:29:45,844 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 14:29:45,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:29:45,845 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 83 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:45,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 61 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 14:29:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-02-20 14:29:45,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:45,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:45,907 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:45,907 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:45,909 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 14:29:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 14:29:45,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:45,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:45,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 14:29:45,910 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 14:29:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:45,911 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 14:29:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 14:29:45,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:45,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:45,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:45,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-02-20 14:29:45,912 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 32 [2022-02-20 14:29:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:45,913 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-02-20 14:29:45,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 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:29:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-02-20 14:29:45,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:29:45,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:45,913 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:45,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:46,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:46,127 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-02-20 14:29:46,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:46,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405061153] [2022-02-20 14:29:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:46,184 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:46,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040905156] [2022-02-20 14:29:46,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:29:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:46,189 INFO L229 MonitoredProcess]: Starting monitored process 9 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:29:46,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 14:29:46,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:29:46,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:46,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:29:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:46,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:46,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3609#true} is VALID [2022-02-20 14:29:46,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3609#true} is VALID [2022-02-20 14:29:46,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3609#true} is VALID [2022-02-20 14:29:46,501 INFO L290 TraceCheckUtils]: 3: Hoare triple {3609#true} assume !(0 == assume_abort_if_not_~cond#1); {3609#true} is VALID [2022-02-20 14:29:46,502 INFO L290 TraceCheckUtils]: 4: Hoare triple {3609#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3656#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:46,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {3656#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3660#(<= ~N~0 3)} is VALID [2022-02-20 14:29:46,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {3660#(<= ~N~0 3)} main_~i~0#1 := 0; {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {3664#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {3674#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {3684#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3694#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:46,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {3694#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3610#false} is VALID [2022-02-20 14:29:46,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {3610#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3610#false} is VALID [2022-02-20 14:29:46,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {3610#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3610#false} is VALID [2022-02-20 14:29:46,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {3610#false} assume !(main_~i~0#1 < ~N~0); {3610#false} is VALID [2022-02-20 14:29:46,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {3610#false} main_~i~0#1 := 0; {3610#false} is VALID [2022-02-20 14:29:46,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {3610#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3610#false} is VALID [2022-02-20 14:29:46,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {3610#false} assume 0 == __VERIFIER_assert_~cond#1; {3610#false} is VALID [2022-02-20 14:29:46,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2022-02-20 14:29:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:46,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:46,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2022-02-20 14:29:46,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {3610#false} assume 0 == __VERIFIER_assert_~cond#1; {3610#false} is VALID [2022-02-20 14:29:46,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {3610#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~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 main_#t~mem13#1 == 1 + (4 * main_~i~0#1 * main_~i~0#1 + 4 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3610#false} is VALID [2022-02-20 14:29:46,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {3610#false} main_~i~0#1 := 0; {3610#false} is VALID [2022-02-20 14:29:46,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {3610#false} assume !(main_~i~0#1 < ~N~0); {3610#false} is VALID [2022-02-20 14:29:46,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {3610#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3610#false} is VALID [2022-02-20 14:29:46,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {3610#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3610#false} is VALID [2022-02-20 14:29:46,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {3740#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0); {3610#false} is VALID [2022-02-20 14:29:46,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3740#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:46,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:46,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:46,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3744#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:46,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~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~mem10#1;havoc main_#t~mem11#1; {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3754#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {3660#(<= ~N~0 3)} main_~i~0#1 := 0; {3764#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:46,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {3656#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3660#(<= ~N~0 3)} is VALID [2022-02-20 14:29:46,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3656#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:46,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3646#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:46,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(8 + main_#t~mem8#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~mem8#1; {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3636#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:46,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(8, main_~a~0#1.base, main_~a~0#1.offset, 8); {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {3609#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3626#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:46,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {3609#true} assume !(0 == assume_abort_if_not_~cond#1); {3609#true} is VALID [2022-02-20 14:29:46,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {3609#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3609#true} is VALID [2022-02-20 14:29:46,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3609#true} is VALID [2022-02-20 14:29:46,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3609#true} is VALID [2022-02-20 14:29:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:46,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:46,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405061153] [2022-02-20 14:29:46,714 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:46,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040905156] [2022-02-20 14:29:46,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040905156] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:46,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:46,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-02-20 14:29:46,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165791838] [2022-02-20 14:29:46,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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 33 [2022-02-20 14:29:46,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:46,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:29:46,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:46,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:29:46,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:29:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:29:46,752 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:29:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,449 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 14:29:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:29:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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 33 [2022-02-20 14:29:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:29:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 14:29:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:29:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 14:29:47,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 122 transitions. [2022-02-20 14:29:47,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:47,570 INFO L225 Difference]: With dead ends: 116 [2022-02-20 14:29:47,570 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 14:29:47,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-20 14:29:47,571 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 149 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:47,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 98 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:29:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 14:29:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-02-20 14:29:47,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:47,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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:29:47,637 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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:29:47,637 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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:29:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,639 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-02-20 14:29:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-02-20 14:29:47,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:47,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:47,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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 103 states. [2022-02-20 14:29:47,639 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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 103 states. [2022-02-20 14:29:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,641 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-02-20 14:29:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-02-20 14:29:47,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:47,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:47,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:47,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 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:29:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-02-20 14:29:47,643 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2022-02-20 14:29:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:47,643 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-02-20 14:29:47,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 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:29:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-02-20 14:29:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:29:47,643 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:47,643 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:47,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 14:29:47,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:29:47,855 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 3 times [2022-02-20 14:29:47,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:47,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613652187] [2022-02-20 14:29:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:47,880 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:47,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825447415] [2022-02-20 14:29:47,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:47,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:47,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:47,882 INFO L229 MonitoredProcess]: Starting monitored process 10 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:29:47,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 14:29:48,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:29:48,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:48,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 14:29:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:48,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:48,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2022-02-20 14:29:48,276 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 11 treesize of output 7 [2022-02-20 14:29:48,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2022-02-20 14:29:48,409 INFO L356 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2022-02-20 14:29:48,409 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 49 treesize of output 95 [2022-02-20 14:29:48,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 12 [2022-02-20 14:29:48,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2022-02-20 14:29:48,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,732 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-02-20 14:29:48,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 124 [2022-02-20 14:29:48,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,841 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-02-20 14:29:48,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 32 [2022-02-20 14:29:48,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:48,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 13 [2022-02-20 14:29:49,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-02-20 14:29:49,850 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 0 case distinctions, treesize of input 162 treesize of output 150 [2022-02-20 14:29:49,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:29:49,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:49,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-02-20 14:29:50,130 WARN L234 Elim1Store]: Array PQE input equivalent to false