./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array5_pattern.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-patterns/array5_pattern.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 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:24:51,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:24:51,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:24:51,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:24:51,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:24:51,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:24:51,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:24:51,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:24:51,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:24:51,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:24:51,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:24:51,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:24:51,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:24:51,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:24:51,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:24:51,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:24:51,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:24:51,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:24:51,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:24:51,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:24:51,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:24:51,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:24:51,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:24:51,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:24:51,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:24:51,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:24:51,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:24:51,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:24:51,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:24:51,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:24:51,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:24:51,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:24:51,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:24:51,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:24:51,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:24:51,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:24:51,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:24:51,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:24:51,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:24:51,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:24:51,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:24:51,712 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:24:51,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:24:51,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:24:51,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:24:51,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:24:51,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:24:51,732 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:24:51,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:24:51,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:24:51,732 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:24:51,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:24:51,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:24:51,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:24:51,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:24:51,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:24:51,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:24:51,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:24:51,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:24:51,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:24:51,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:51,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:24:51,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:24:51,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:24:51,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:24:51,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:24:51,736 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:24:51,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:24:51,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:24:51,737 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 -> 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 [2022-02-20 14:24:51,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:24:51,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:24:51,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:24:51,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:24:51,940 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:24:51,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array5_pattern.c [2022-02-20 14:24:51,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9668eef/bc7f3545b6714ba4aafc72e139b76729/FLAGaffacfde9 [2022-02-20 14:24:52,346 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:24:52,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array5_pattern.c [2022-02-20 14:24:52,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9668eef/bc7f3545b6714ba4aafc72e139b76729/FLAGaffacfde9 [2022-02-20 14:24:52,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9668eef/bc7f3545b6714ba4aafc72e139b76729 [2022-02-20 14:24:52,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:24:52,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:24:52,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:52,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:24:52,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:24:52,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:52" (1/1) ... [2022-02-20 14:24:52,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608994ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:52, skipping insertion in model container [2022-02-20 14:24:52,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:24:52" (1/1) ... [2022-02-20 14:24:52,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:24:52,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:24:52,940 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-patterns/array5_pattern.c[1890,1903] [2022-02-20 14:24:52,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:52,967 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:24:52,980 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-patterns/array5_pattern.c[1890,1903] [2022-02-20 14:24:52,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:24:53,007 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:24:53,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53 WrapperNode [2022-02-20 14:24:53,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:24:53,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:53,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:24:53,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:24:53,013 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:24:53" (1/1) ... [2022-02-20 14:24:53,018 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:24:53" (1/1) ... [2022-02-20 14:24:53,034 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-02-20 14:24:53,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:24:53,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:24:53,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:24:53,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:24:53,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:24:53,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:24:53,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:24:53,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:24:53,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (1/1) ... [2022-02-20 14:24:53,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:24:53,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:53,091 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:24:53,103 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:24:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:24:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 14:24:53,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 14:24:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:24:53,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:24:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:24:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:24:53,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:24:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:24:53,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:24:53,179 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:24:53,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:53,363 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:53,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:53,369 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:24:53,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:53 BoogieIcfgContainer [2022-02-20 14:24:53,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:53,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:53,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:53,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:53,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:24:52" (1/3) ... [2022-02-20 14:24:53,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2091ac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:53, skipping insertion in model container [2022-02-20 14:24:53,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:24:53" (2/3) ... [2022-02-20 14:24:53,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2091ac85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:53, skipping insertion in model container [2022-02-20 14:24:53,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:53" (3/3) ... [2022-02-20 14:24:53,388 INFO L111 eAbstractionObserver]: Analyzing ICFG array5_pattern.c [2022-02-20 14:24:53,394 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:53,394 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:53,431 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:53,437 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:24:53,438 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:24:53,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:53,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:53,454 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:53,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:53,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1359011546, now seen corresponding path program 1 times [2022-02-20 14:24:53,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:53,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832240942] [2022-02-20 14:24:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:53,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 14:24:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:53,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:53,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:53,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #87#return; {32#false} is VALID [2022-02-20 14:24:53,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {31#true} is VALID [2022-02-20 14:24:53,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {31#true} is VALID [2022-02-20 14:24:53,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {31#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {31#true} is VALID [2022-02-20 14:24:53,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2022-02-20 14:24:53,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2022-02-20 14:24:53,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume true; {32#false} is VALID [2022-02-20 14:24:53,613 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {32#false} {31#true} #87#return; {32#false} is VALID [2022-02-20 14:24:53,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {32#false} is VALID [2022-02-20 14:24:53,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 14:24:53,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} main_~count~0#1 := 1; {32#false} is VALID [2022-02-20 14:24:53,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 14:24:53,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#false} main_~count~0#1 := 0; {32#false} is VALID [2022-02-20 14:24:53,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {32#false} is VALID [2022-02-20 14:24:53,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {32#false} is VALID [2022-02-20 14:24:53,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume 0 == __VERIFIER_assert_~cond#1; {32#false} is VALID [2022-02-20 14:24:53,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:24:53,618 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:24:53,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:53,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832240942] [2022-02-20 14:24:53,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832240942] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:53,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:53,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:53,621 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063442564] [2022-02-20 14:24:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 14:24:53,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:53,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:53,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:53,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:53,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:53,681 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:53,737 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-02-20 14:24:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 14:24:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 14:24:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2022-02-20 14:24:53,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2022-02-20 14:24:53,833 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:24:53,841 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:24:53,841 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 14:24:53,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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:24:53,847 INFO L933 BasicCegarLoop]: 33 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, 33 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:24:53,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 14:24:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 14:24:53,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:53,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,871 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,872 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:53,874 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 14:24:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:24:53,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:53,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:53,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 14:24:53,876 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 14:24:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:53,877 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 14:24:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:24:53,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:53,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:53,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:53,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:53,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 14:24:53,881 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2022-02-20 14:24:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:53,881 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 14:24:53,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 14:24:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:24:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:24:53,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:53,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:53,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:53,883 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1765206397, now seen corresponding path program 1 times [2022-02-20 14:24:53,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:53,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443841509] [2022-02-20 14:24:53,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:53,931 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:53,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535264203] [2022-02-20 14:24:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:53,935 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:24:53,936 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:24:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 14:24:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:54,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {183#true} is VALID [2022-02-20 14:24:54,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {183#true} is VALID [2022-02-20 14:24:54,165 INFO L272 TraceCheckUtils]: 2: Hoare triple {183#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {183#true} is VALID [2022-02-20 14:24:54,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#true} ~cond := #in~cond; {183#true} is VALID [2022-02-20 14:24:54,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {183#true} assume !(0 == ~cond); {183#true} is VALID [2022-02-20 14:24:54,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} assume true; {183#true} is VALID [2022-02-20 14:24:54,166 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {183#true} {183#true} #87#return; {183#true} is VALID [2022-02-20 14:24:54,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {183#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {183#true} is VALID [2022-02-20 14:24:54,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#true} assume !(main_~count~0#1 < ~ARR_SIZE~0); {183#true} is VALID [2022-02-20 14:24:54,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#true} main_~count~0#1 := 1; {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:54,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:54,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {183#true} is VALID [2022-02-20 14:24:54,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#true} ~cond := #in~cond; {183#true} is VALID [2022-02-20 14:24:54,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#true} assume !(0 == ~cond); {183#true} is VALID [2022-02-20 14:24:54,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#true} assume true; {183#true} is VALID [2022-02-20 14:24:54,170 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {183#true} {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} #89#return; {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:54,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:54,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {215#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume 200 == main_~count~0#1;main_~count~0#1 := 0; {184#false} is VALID [2022-02-20 14:24:54,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {184#false} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {184#false} is VALID [2022-02-20 14:24:54,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {184#false} assume 0 == main_~temp~0#1; {184#false} is VALID [2022-02-20 14:24:54,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {184#false} main_~count~0#1 := 0; {184#false} is VALID [2022-02-20 14:24:54,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {184#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {184#false} is VALID [2022-02-20 14:24:54,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {184#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {184#false} is VALID [2022-02-20 14:24:54,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {184#false} assume 0 == __VERIFIER_assert_~cond#1; {184#false} is VALID [2022-02-20 14:24:54,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-02-20 14:24:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:54,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:54,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:54,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443841509] [2022-02-20 14:24:54,173 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:54,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535264203] [2022-02-20 14:24:54,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535264203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:54,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:54,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:24:54,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479033632] [2022-02-20 14:24:54,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 14:24:54,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:54,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:24:54,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:54,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:24:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:24:54,202 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,278 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-02-20 14:24:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:24:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 14:24:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:24:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:24:54,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 14:24:54,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,336 INFO L225 Difference]: With dead ends: 55 [2022-02-20 14:24:54,336 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:24:54,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:24:54,339 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:54,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:24:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 14:24:54,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:54,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,351 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,353 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,357 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 14:24:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 14:24:54,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:24:54,358 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 14:24:54,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,365 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 14:24:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 14:24:54,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:54,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-20 14:24:54,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-02-20 14:24:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:54,368 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-20 14:24:54,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:24:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:24:54,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:54,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:54,390 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:24:54,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:54,588 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash 955859771, now seen corresponding path program 1 times [2022-02-20 14:24:54,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:54,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726187280] [2022-02-20 14:24:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:54,611 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:54,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673144080] [2022-02-20 14:24:54,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:54,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:54,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:54,615 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:24:54,617 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:24:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:24:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:54,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:54,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {441#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {441#true} is VALID [2022-02-20 14:24:54,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {441#true} is VALID [2022-02-20 14:24:54,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {441#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {441#true} is VALID [2022-02-20 14:24:54,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {441#true} ~cond := #in~cond; {441#true} is VALID [2022-02-20 14:24:54,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {441#true} assume !(0 == ~cond); {441#true} is VALID [2022-02-20 14:24:54,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#true} assume true; {441#true} is VALID [2022-02-20 14:24:54,792 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {441#true} {441#true} #87#return; {441#true} is VALID [2022-02-20 14:24:54,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {441#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~count~0#1 := 1; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {441#true} is VALID [2022-02-20 14:24:54,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {441#true} ~cond := #in~cond; {441#true} is VALID [2022-02-20 14:24:54,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {441#true} assume !(0 == ~cond); {441#true} is VALID [2022-02-20 14:24:54,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {441#true} assume true; {441#true} is VALID [2022-02-20 14:24:54,796 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {441#true} {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} #89#return; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(200 == main_~count~0#1); {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume 0 == main_~temp~0#1; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~count~0#1 := 0; {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:54,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {513#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:54,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {513#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {442#false} is VALID [2022-02-20 14:24:54,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {442#false} assume !false; {442#false} is VALID [2022-02-20 14:24:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:24:54,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:54,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:54,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726187280] [2022-02-20 14:24:54,803 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:54,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673144080] [2022-02-20 14:24:54,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673144080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:54,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:54,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:54,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046562516] [2022-02-20 14:24:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:54,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 14:24:54,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:54,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:54,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:54,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:54,820 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,866 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 14:24:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-02-20 14:24:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 14:24:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 14:24:54,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 14:24:54,896 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:24:54,898 INFO L225 Difference]: With dead ends: 33 [2022-02-20 14:24:54,898 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 14:24:54,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:54,899 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:54,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 14:24:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 14:24:54,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:54,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,905 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,905 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,907 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 14:24:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 14:24:54,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 14:24:54,908 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 14:24:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:54,909 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 14:24:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 14:24:54,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:54,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:54,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:54,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-02-20 14:24:54,911 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-02-20 14:24:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:54,912 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-02-20 14:24:54,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-02-20 14:24:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:24:54,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:54,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:54,929 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:24:55,127 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,SelfDestructingSolverStorable2 [2022-02-20 14:24:55,128 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash -488527555, now seen corresponding path program 1 times [2022-02-20 14:24:55,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:55,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891382107] [2022-02-20 14:24:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:55,150 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:55,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [104595369] [2022-02-20 14:24:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:55,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:55,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:55,152 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:24:55,153 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:24:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:55,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:55,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:55,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {659#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {659#true} is VALID [2022-02-20 14:24:55,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {659#true} is VALID [2022-02-20 14:24:55,344 INFO L272 TraceCheckUtils]: 2: Hoare triple {659#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {659#true} is VALID [2022-02-20 14:24:55,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-02-20 14:24:55,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-02-20 14:24:55,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume true; {659#true} is VALID [2022-02-20 14:24:55,345 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {659#true} {659#true} #87#return; {659#true} is VALID [2022-02-20 14:24:55,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {685#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:55,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {689#(<= ~ARR_SIZE~0 0)} main_~count~0#1 := 1; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,351 INFO L272 TraceCheckUtils]: 11: Hoare triple {689#(<= ~ARR_SIZE~0 0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#(<= ~ARR_SIZE~0 0)} ~cond := #in~cond; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume !(0 == ~cond); {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume true; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,353 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {689#(<= ~ARR_SIZE~0 0)} {689#(<= ~ARR_SIZE~0 0)} #89#return; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume !(200 == main_~count~0#1); {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {689#(<= ~ARR_SIZE~0 0)} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {689#(<= ~ARR_SIZE~0 0)} assume 0 == main_~temp~0#1; {689#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:55,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {689#(<= ~ARR_SIZE~0 0)} main_~count~0#1 := 0; {726#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 0))} is VALID [2022-02-20 14:24:55,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(and (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= ~ARR_SIZE~0 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {660#false} is VALID [2022-02-20 14:24:55,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {660#false} is VALID [2022-02-20 14:24:55,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {660#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {660#false} is VALID [2022-02-20 14:24:55,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {660#false} is VALID [2022-02-20 14:24:55,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume 0 == __VERIFIER_assert_~cond#1; {660#false} is VALID [2022-02-20 14:24:55,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-02-20 14:24:55,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:55,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:55,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:55,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891382107] [2022-02-20 14:24:55,357 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:55,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104595369] [2022-02-20 14:24:55,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104595369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:55,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:55,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:55,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948736009] [2022-02-20 14:24:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 14:24:55,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:55,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:55,378 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:24:55,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:55,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:55,379 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:55,518 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-02-20 14:24:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:24:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-02-20 14:24:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 14:24:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 14:24:55,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-02-20 14:24:55,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:55,568 INFO L225 Difference]: With dead ends: 57 [2022-02-20 14:24:55,568 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 14:24:55,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:24:55,569 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:55,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 14:24:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-02-20 14:24:55,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:55,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:55,574 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:55,574 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:55,576 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 14:24:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 14:24:55,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:55,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:55,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 14:24:55,577 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 33 states. [2022-02-20 14:24:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:55,578 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-20 14:24:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-02-20 14:24:55,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:55,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:55,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:55,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:24:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-02-20 14:24:55,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2022-02-20 14:24:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:55,580 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-20 14:24:55,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:24:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 14:24:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:24:55,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:55,581 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:55,600 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:24:55,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:55,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -309168389, now seen corresponding path program 1 times [2022-02-20 14:24:55,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:55,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346536206] [2022-02-20 14:24:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:55,824 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:55,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [82623728] [2022-02-20 14:24:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:55,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:55,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:55,828 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:24:55,829 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:24:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:55,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:24:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:55,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:56,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {928#true} is VALID [2022-02-20 14:24:56,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {928#true} is VALID [2022-02-20 14:24:56,197 INFO L272 TraceCheckUtils]: 2: Hoare triple {928#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {928#true} is VALID [2022-02-20 14:24:56,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {928#true} ~cond := #in~cond; {928#true} is VALID [2022-02-20 14:24:56,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {928#true} assume !(0 == ~cond); {928#true} is VALID [2022-02-20 14:24:56,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#true} assume true; {928#true} is VALID [2022-02-20 14:24:56,197 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {928#true} {928#true} #87#return; {928#true} is VALID [2022-02-20 14:24:56,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {954#(= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:56,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {954#(= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {954#(= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:56,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {954#(= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {961#(= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:56,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} main_~count~0#1 := 1; {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,202 INFO L272 TraceCheckUtils]: 13: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} ~cond := #in~cond; {978#(and (not (< 1 ~ARR_SIZE~0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:24:56,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#(and (not (< 1 ~ARR_SIZE~0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {982#(and (not (= |assume_abort_if_not_#in~cond| 0)) (not (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:56,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {982#(and (not (= |assume_abort_if_not_#in~cond| 0)) (not (< 1 ~ARR_SIZE~0)))} assume true; {982#(and (not (= |assume_abort_if_not_#in~cond| 0)) (not (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:56,204 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {982#(and (not (= |assume_abort_if_not_#in~cond| 0)) (not (< 1 ~ARR_SIZE~0)))} {965#(not (< 1 ~ARR_SIZE~0))} #89#return; {989#(and (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|))} is VALID [2022-02-20 14:24:56,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {989#(and (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|))} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {929#false} is VALID [2022-02-20 14:24:56,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#false} assume !(200 == main_~count~0#1); {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#false} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#false} assume 0 == main_~temp~0#1; {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {929#false} main_~count~0#1 := 0; {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {929#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {929#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {929#false} is VALID [2022-02-20 14:24:56,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {929#false} is VALID [2022-02-20 14:24:56,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#false} assume 0 == __VERIFIER_assert_~cond#1; {929#false} is VALID [2022-02-20 14:24:56,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {929#false} assume !false; {929#false} is VALID [2022-02-20 14:24:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:24:56,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:56,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {929#false} assume !false; {929#false} is VALID [2022-02-20 14:24:56,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#false} assume 0 == __VERIFIER_assert_~cond#1; {929#false} is VALID [2022-02-20 14:24:56,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {929#false} is VALID [2022-02-20 14:24:56,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#false} assume !(main_~count~0#1 < ~ARR_SIZE~0); {929#false} is VALID [2022-02-20 14:24:56,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {929#false} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {929#false} is VALID [2022-02-20 14:24:56,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {929#false} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {929#false} is VALID [2022-02-20 14:24:56,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {929#false} main_~count~0#1 := 0; {929#false} is VALID [2022-02-20 14:24:56,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#false} assume 0 == main_~temp~0#1; {929#false} is VALID [2022-02-20 14:24:56,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#false} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {929#false} is VALID [2022-02-20 14:24:56,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#false} assume !(200 == main_~count~0#1); {929#false} is VALID [2022-02-20 14:24:56,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {1053#(= (mod |ULTIMATE.start_main_~index~0#1| 2) 0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {929#false} is VALID [2022-02-20 14:24:56,750 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1060#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} {965#(not (< 1 ~ARR_SIZE~0))} #89#return; {1053#(= (mod |ULTIMATE.start_main_~index~0#1| 2) 0)} is VALID [2022-02-20 14:24:56,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {1060#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} assume true; {1060#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1060#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {928#true} ~cond := #in~cond; {1067#(or (not (= |assume_abort_if_not_#in~cond| 0)) (< 1 ~ARR_SIZE~0) (= assume_abort_if_not_~cond 0))} is VALID [2022-02-20 14:24:56,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {928#true} is VALID [2022-02-20 14:24:56,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {965#(not (< 1 ~ARR_SIZE~0))} main_~count~0#1 := 1; {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1080#(<= |ULTIMATE.start_main_~count~0#1| 1)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {965#(not (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:56,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1084#(<= |ULTIMATE.start_main_~count~0#1| 0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1080#(<= |ULTIMATE.start_main_~count~0#1| 1)} is VALID [2022-02-20 14:24:56,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1084#(<= |ULTIMATE.start_main_~count~0#1| 0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1084#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:56,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {928#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1084#(<= |ULTIMATE.start_main_~count~0#1| 0)} is VALID [2022-02-20 14:24:56,753 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {928#true} {928#true} #87#return; {928#true} is VALID [2022-02-20 14:24:56,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {928#true} assume true; {928#true} is VALID [2022-02-20 14:24:56,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {928#true} assume !(0 == ~cond); {928#true} is VALID [2022-02-20 14:24:56,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {928#true} ~cond := #in~cond; {928#true} is VALID [2022-02-20 14:24:56,754 INFO L272 TraceCheckUtils]: 2: Hoare triple {928#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {928#true} is VALID [2022-02-20 14:24:56,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {928#true} is VALID [2022-02-20 14:24:56,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {928#true} is VALID [2022-02-20 14:24:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:56,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:56,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346536206] [2022-02-20 14:24:56,754 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:56,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82623728] [2022-02-20 14:24:56,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82623728] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:56,754 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:56,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-02-20 14:24:56,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691886755] [2022-02-20 14:24:56,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:56,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 14:24:56,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:56,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:56,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:56,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:24:56,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:56,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:24:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:24:56,781 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,598 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2022-02-20 14:24:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 14:24:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-02-20 14:24:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 138 transitions. [2022-02-20 14:24:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 138 transitions. [2022-02-20 14:24:57,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 138 transitions. [2022-02-20 14:24:57,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:57,715 INFO L225 Difference]: With dead ends: 124 [2022-02-20 14:24:57,715 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 14:24:57,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:24:57,716 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 168 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:57,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 256 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:24:57,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 14:24:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 55. [2022-02-20 14:24:57,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:57,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:24:57,737 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:24:57,737 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:24:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,756 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2022-02-20 14:24:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2022-02-20 14:24:57,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 105 states. [2022-02-20 14:24:57,758 INFO L87 Difference]: Start difference. First operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 105 states. [2022-02-20 14:24:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:57,761 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2022-02-20 14:24:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2022-02-20 14:24:57,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:57,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:57,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:57,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 14:24:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-02-20 14:24:57,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 29 [2022-02-20 14:24:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:57,764 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-02-20 14:24:57,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:24:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-02-20 14:24:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:24:57,765 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:57,765 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:57,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 14:24:57,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:57,980 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:57,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1010232967, now seen corresponding path program 1 times [2022-02-20 14:24:57,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:57,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642546478] [2022-02-20 14:24:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:57,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:58,004 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:58,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082527235] [2022-02-20 14:24:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:58,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:58,006 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:24:58,007 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:24:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 14:24:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:58,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:58,115 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:24:58,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:58,377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-02-20 14:24:58,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 14:24:58,409 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 27 treesize of output 26 [2022-02-20 14:24:58,950 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-02-20 14:24:58,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 23 [2022-02-20 14:24:59,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {1575#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1575#true} is VALID [2022-02-20 14:24:59,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1575#true} is VALID [2022-02-20 14:24:59,027 INFO L272 TraceCheckUtils]: 2: Hoare triple {1575#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1575#true} is VALID [2022-02-20 14:24:59,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {1575#true} ~cond := #in~cond; {1575#true} is VALID [2022-02-20 14:24:59,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {1575#true} assume !(0 == ~cond); {1575#true} is VALID [2022-02-20 14:24:59,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-02-20 14:24:59,028 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1575#true} {1575#true} #87#return; {1575#true} is VALID [2022-02-20 14:24:59,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1575#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1601#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {1601#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1601#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1601#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1608#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1608#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~count~0#1| 1) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1612#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1612#(and (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 1; {1616#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {1616#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1616#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,032 INFO L272 TraceCheckUtils]: 13: Hoare triple {1616#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1623#(<= ~ARR_SIZE~0 1)} is VALID [2022-02-20 14:24:59,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {1623#(<= ~ARR_SIZE~0 1)} ~cond := #in~cond; {1627#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} is VALID [2022-02-20 14:24:59,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {1627#(and (<= ~ARR_SIZE~0 1) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|))} assume !(0 == ~cond); {1631#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:59,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {1631#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} assume true; {1631#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} is VALID [2022-02-20 14:24:59,034 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1631#(and (<= ~ARR_SIZE~0 1) (not (= |assume_abort_if_not_#in~cond| 0)))} {1616#(and (= |ULTIMATE.start_main_~count~0#1| 1) (<= ~ARR_SIZE~0 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} #89#return; {1638#(and (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {1638#(and (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (+ |ULTIMATE.start_main_~num~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !(200 == main_~count~0#1); {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == main_~temp~0#1; {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {1642#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} main_~count~0#1 := 0; {1655#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:24:59,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {1655#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (exists ((|ULTIMATE.start_main_~index~0#1| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|))) 1) (< |ULTIMATE.start_main_~index~0#1| 1) (<= 0 |ULTIMATE.start_main_~index~0#1|) (= (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* 4 |ULTIMATE.start_main_~index~0#1|)))))) (= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:24:59,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:24:59,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:24:59,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1669#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:59,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1669#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1576#false} is VALID [2022-02-20 14:24:59,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-02-20 14:24:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:59,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:59,236 INFO L356 Elim1Store]: treesize reduction 21, result has 63.8 percent of original size [2022-02-20 14:24:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 114 [2022-02-20 14:24:59,268 INFO L356 Elim1Store]: treesize reduction 18, result has 59.1 percent of original size [2022-02-20 14:24:59,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 78 [2022-02-20 14:24:59,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:59,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 179 [2022-02-20 14:24:59,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:59,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 150 [2022-02-20 14:24:59,461 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 60 treesize of output 58 [2022-02-20 14:24:59,502 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 191 treesize of output 185 [2022-02-20 14:25:00,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-02-20 14:25:00,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {1669#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1576#false} is VALID [2022-02-20 14:25:00,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1669#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:25:00,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {1691#(= (- 1) (+ (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1659#(= (- 1) (+ (- 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} main_~count~0#1 := 0; {1691#(= (- 1) (+ (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) (+ |ULTIMATE.start_main_~#array1~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) (+ |ULTIMATE.start_main_~#array2~0#1.offset| (* |ULTIMATE.start_main_~count~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} assume 0 == main_~temp~0#1; {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} assume !(200 == main_~count~0#1); {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {1708#(and (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} assume 0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * main_~count~0#1, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {1695#(= (- 1) (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array2~0#1.base|) |ULTIMATE.start_main_~#array2~0#1.offset|) (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~#array1~0#1.base|) |ULTIMATE.start_main_~#array1~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:25:00,584 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1716#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} {1712#(and (<= ~ARR_SIZE~0 1) (or (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (<= ~ARR_SIZE~0 0)) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} #89#return; {1708#(and (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (= (* 4 |ULTIMATE.start_main_~index~0#1|) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|)))} is VALID [2022-02-20 14:25:00,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1716#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} assume true; {1716#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:25:00,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (not (<= ~ARR_SIZE~0 1)))} assume !(0 == ~cond); {1716#(or (not (= |assume_abort_if_not_#in~cond| 0)) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:25:00,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {1575#true} ~cond := #in~cond; {1723#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0) (not (<= ~ARR_SIZE~0 1)))} is VALID [2022-02-20 14:25:00,586 INFO L272 TraceCheckUtils]: 13: Hoare triple {1712#(and (<= ~ARR_SIZE~0 1) (or (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (<= ~ARR_SIZE~0 0)) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {1575#true} is VALID [2022-02-20 14:25:00,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#(and (<= ~ARR_SIZE~0 1) (or (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (<= ~ARR_SIZE~0 0)) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1712#(and (<= ~ARR_SIZE~0 1) (or (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (<= ~ARR_SIZE~0 0)) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} is VALID [2022-02-20 14:25:00,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(and (or (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0) (<= ~ARR_SIZE~0 0)) (<= ~ARR_SIZE~0 1) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} main_~count~0#1 := 1; {1712#(and (<= ~ARR_SIZE~0 1) (or (= (+ (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1|) |ULTIMATE.start_main_~sum~0#1| (* |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1|)) 0) (<= ~ARR_SIZE~0 0)) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} is VALID [2022-02-20 14:25:00,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {1737#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (or (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0) (<= |ULTIMATE.start_main_~count~0#1| 0)) (or (<= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {1733#(and (or (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0) (<= ~ARR_SIZE~0 0)) (<= ~ARR_SIZE~0 1) (or (<= ~ARR_SIZE~0 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} is VALID [2022-02-20 14:25:00,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1741#(and (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))) (<= |ULTIMATE.start_main_~count~0#1| 0) (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0)))} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1737#(and (<= |ULTIMATE.start_main_~count~0#1| 1) (or (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0) (<= |ULTIMATE.start_main_~count~0#1| 0)) (or (<= |ULTIMATE.start_main_~count~0#1| 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))))} is VALID [2022-02-20 14:25:00,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {1741#(and (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))) (<= |ULTIMATE.start_main_~count~0#1| 0) (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0)))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {1741#(and (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))) (<= |ULTIMATE.start_main_~count~0#1| 0) (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0)))} is VALID [2022-02-20 14:25:00,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {1575#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {1741#(and (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (not (= |ULTIMATE.start_main_~#array2~0#1.base| |ULTIMATE.start_main_~#array1~0#1.base|))) (<= |ULTIMATE.start_main_~count~0#1| 0) (or (<= (+ |ULTIMATE.start_main_~count~0#1| 1) 0) (= (+ (* |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~num~0#1| 1) |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~sum~0#1|) 0)))} is VALID [2022-02-20 14:25:00,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1575#true} {1575#true} #87#return; {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {1575#true} assume !(0 == ~cond); {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {1575#true} ~cond := #in~cond; {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L272 TraceCheckUtils]: 2: Hoare triple {1575#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1575#true} is VALID [2022-02-20 14:25:00,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {1575#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1575#true} is VALID [2022-02-20 14:25:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:25:00,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:00,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642546478] [2022-02-20 14:25:00,596 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:00,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082527235] [2022-02-20 14:25:00,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082527235] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:00,597 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:00,597 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2022-02-20 14:25:00,597 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723577351] [2022-02-20 14:25:00,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 14:25:00,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:00,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:00,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:00,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 14:25:00,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 14:25:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-02-20 14:25:00,636 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,538 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-02-20 14:25:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:25:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-02-20 14:25:01,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 59 transitions. [2022-02-20 14:25:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 59 transitions. [2022-02-20 14:25:01,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 59 transitions. [2022-02-20 14:25:01,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:01,598 INFO L225 Difference]: With dead ends: 77 [2022-02-20 14:25:01,598 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 14:25:01,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-02-20 14:25:01,600 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:01,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 228 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 218 Invalid, 0 Unknown, 26 Unchecked, 0.4s Time] [2022-02-20 14:25:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 14:25:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-02-20 14:25:01,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:01,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:01,623 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:01,623 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,625 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 14:25:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 14:25:01,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-02-20 14:25:01,625 INFO L87 Difference]: Start difference. First operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 69 states. [2022-02-20 14:25:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:01,627 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-02-20 14:25:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-02-20 14:25:01,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:01,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:01,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:01,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-02-20 14:25:01,630 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2022-02-20 14:25:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:01,630 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-02-20 14:25:01,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 14:25:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-02-20 14:25:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:25:01,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:01,631 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, 1, 1, 1] [2022-02-20 14:25:01,652 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:25:01,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:01,844 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 256298297, now seen corresponding path program 2 times [2022-02-20 14:25:01,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:01,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830217990] [2022-02-20 14:25:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:01,872 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:01,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1002693174] [2022-02-20 14:25:01,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:25:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:01,888 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:25:01,889 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:25:01,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:25:01,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:01,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:25:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:01,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:02,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {2107#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2107#true} is VALID [2022-02-20 14:25:02,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {2107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2107#true} is VALID [2022-02-20 14:25:02,076 INFO L272 TraceCheckUtils]: 2: Hoare triple {2107#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2107#true} is VALID [2022-02-20 14:25:02,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {2107#true} ~cond := #in~cond; {2107#true} is VALID [2022-02-20 14:25:02,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {2107#true} assume !(0 == ~cond); {2107#true} is VALID [2022-02-20 14:25:02,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {2107#true} assume true; {2107#true} is VALID [2022-02-20 14:25:02,077 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2107#true} {2107#true} #87#return; {2107#true} is VALID [2022-02-20 14:25:02,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {2107#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2140#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {2140#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,081 INFO L272 TraceCheckUtils]: 15: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} ~cond := #in~cond; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(0 == ~cond); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume true; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,082 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2144#(< 1 ~ARR_SIZE~0)} {2144#(< 1 ~ARR_SIZE~0)} #89#return; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(200 == main_~count~0#1); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {2187#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:02,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {2187#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2187#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} is VALID [2022-02-20 14:25:02,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {2187#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 0))} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2194#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1))} is VALID [2022-02-20 14:25:02,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {2194#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~count~0#1| 1))} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2108#false} is VALID [2022-02-20 14:25:02,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {2108#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2108#false} is VALID [2022-02-20 14:25:02,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {2108#false} assume 0 == __VERIFIER_assert_~cond#1; {2108#false} is VALID [2022-02-20 14:25:02,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {2108#false} assume !false; {2108#false} is VALID [2022-02-20 14:25:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:25:02,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:25:02,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {2108#false} assume !false; {2108#false} is VALID [2022-02-20 14:25:02,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {2108#false} assume 0 == __VERIFIER_assert_~cond#1; {2108#false} is VALID [2022-02-20 14:25:02,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {2108#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2108#false} is VALID [2022-02-20 14:25:02,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {2216#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2108#false} is VALID [2022-02-20 14:25:02,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {2220#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} main_#t~post9#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2216#(< |ULTIMATE.start_main_~count~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {2220#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call main_#t~mem10#1 := read~int(main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call main_#t~mem11#1 := read~int(main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1 + main_#t~mem11#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2220#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 0; {2220#(< (+ |ULTIMATE.start_main_~count~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume 0 == main_~temp~0#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_#t~post7#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~temp~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(200 == main_~count~0#1); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(0 == (if main_~index~0#1 < 0 && 0 != main_~index~0#1 % 2 then main_~index~0#1 % 2 - 2 else main_~index~0#1 % 2));call write~int(main_~num~0#1 * main_~count~0#1, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~index~0#1, 4);call write~int(main_~num~0#1 * (main_~num~0#1 * main_~count~0#1), main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~index~0#1, 4); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,224 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2107#true} {2144#(< 1 ~ARR_SIZE~0)} #89#return; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {2107#true} assume true; {2107#true} is VALID [2022-02-20 14:25:02,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#true} assume !(0 == ~cond); {2107#true} is VALID [2022-02-20 14:25:02,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#true} ~cond := #in~cond; {2107#true} is VALID [2022-02-20 14:25:02,226 INFO L272 TraceCheckUtils]: 15: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} call assume_abort_if_not((if main_~index~0#1 >= 0 && main_~index~0#1 < ~ARR_SIZE~0 then 1 else 0)); {2107#true} is VALID [2022-02-20 14:25:02,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !false;assume -32768 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 32767;main_~index~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_~count~0#1 := 1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} assume !(main_~count~0#1 < ~ARR_SIZE~0); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {2144#(< 1 ~ARR_SIZE~0)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {2140#(<= 1 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2144#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:25:02,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} main_#t~post5#1 := main_~count~0#1;main_~count~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2140#(<= 1 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} assume !!(main_~count~0#1 < ~ARR_SIZE~0);call write~int(0, main_~#array1~0#1.base, main_~#array1~0#1.offset + 4 * main_~count~0#1, 4);call write~int(0, main_~#array2~0#1.base, main_~#array2~0#1.offset + 4 * main_~count~0#1, 4); {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {2107#true} call main_~#array1~0#1.base, main_~#array1~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));call main_~#array2~0#1.base, main_~#array2~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~count~0#1 := 0;main_~num~0#1 := -1;main_~sum~0#1 := 0;havoc main_~temp~0#1;havoc main_~index~0#1;main_~count~0#1 := 0; {2133#(<= 0 |ULTIMATE.start_main_~count~0#1|)} is VALID [2022-02-20 14:25:02,229 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2107#true} {2107#true} #87#return; {2107#true} is VALID [2022-02-20 14:25:02,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {2107#true} assume true; {2107#true} is VALID [2022-02-20 14:25:02,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {2107#true} assume !(0 == ~cond); {2107#true} is VALID [2022-02-20 14:25:02,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {2107#true} ~cond := #in~cond; {2107#true} is VALID [2022-02-20 14:25:02,230 INFO L272 TraceCheckUtils]: 2: Hoare triple {2107#true} call assume_abort_if_not((if ~ARR_SIZE~0 > 0 then 1 else 0)); {2107#true} is VALID [2022-02-20 14:25:02,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~nondet6#1, main_#t~post7#1, main_#t~nondet8#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_~#array1~0#1.base, main_~#array1~0#1.offset, main_~#array2~0#1.base, main_~#array2~0#1.offset, main_~count~0#1, main_~num~0#1, main_~sum~0#1, main_~temp~0#1, main_~index~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2107#true} is VALID [2022-02-20 14:25:02,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {2107#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(17, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {2107#true} is VALID [2022-02-20 14:25:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 14:25:02,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:02,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830217990] [2022-02-20 14:25:02,231 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:02,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002693174] [2022-02-20 14:25:02,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002693174] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:25:02,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:25:02,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:25:02,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536121127] [2022-02-20 14:25:02,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:25:02,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:02,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:25:02,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:02,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:25:02,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:25:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:25:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:25:02,258 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,807 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-02-20 14:25:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:25:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 14:25:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:25:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-02-20 14:25:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions. [2022-02-20 14:25:02,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 73 transitions. [2022-02-20 14:25:02,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:25:02,870 INFO L225 Difference]: With dead ends: 82 [2022-02-20 14:25:02,870 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 14:25:02,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:25:02,870 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:25:02,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 110 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:25:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 14:25:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-02-20 14:25:02,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:25:02,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:02,910 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:02,910 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,912 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-02-20 14:25:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-02-20 14:25:02,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 78 states. [2022-02-20 14:25:02,914 INFO L87 Difference]: Start difference. First operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 78 states. [2022-02-20 14:25:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:25:02,916 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-02-20 14:25:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2022-02-20 14:25:02,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:25:02,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:25:02,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:25:02,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:25:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 14:25:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-02-20 14:25:02,920 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 31 [2022-02-20 14:25:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:25:02,920 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-02-20 14:25:02,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 14:25:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-02-20 14:25:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:25:02,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:25:02,921 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:25:02,942 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:25:03,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:03,135 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:25:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:25:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1542761403, now seen corresponding path program 3 times [2022-02-20 14:25:03,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:25:03,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156294977] [2022-02-20 14:25:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:25:03,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:25:03,154 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:25:03,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807749907] [2022-02-20 14:25:03,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:25:03,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:25:03,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:25:03,156 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:25:03,167 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:25:03,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:25:03,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:25:03,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 14:25:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:25:03,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:25:03,305 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:25:03,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:03,335 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-02-20 14:25:03,340 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 20 treesize of output 20 [2022-02-20 14:25:03,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:25:03,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:25:03,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:03,407 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-02-20 14:25:03,413 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 35 treesize of output 33 [2022-02-20 14:25:03,425 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 14:25:03,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 22 [2022-02-20 14:25:03,435 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 14:25:03,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 22 [2022-02-20 14:25:09,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:09,474 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-02-20 14:25:09,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 123 [2022-02-20 14:25:09,714 INFO L356 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-02-20 14:25:09,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 96 [2022-02-20 14:25:10,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,441 INFO L356 Elim1Store]: treesize reduction 67, result has 40.7 percent of original size [2022-02-20 14:25:10,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2022-02-20 14:25:10,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,536 INFO L356 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2022-02-20 14:25:10,536 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 30 treesize of output 51 [2022-02-20 14:25:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,714 INFO L356 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2022-02-20 14:25:10,715 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 30 treesize of output 51 [2022-02-20 14:25:10,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:10,816 INFO L356 Elim1Store]: treesize reduction 31, result has 42.6 percent of original size [2022-02-20 14:25:10,816 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 30 treesize of output 51 [2022-02-20 14:25:11,087 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 14:25:11,159 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 14:25:11,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,339 INFO L356 Elim1Store]: treesize reduction 67, result has 40.7 percent of original size [2022-02-20 14:25:11,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2022-02-20 14:25:11,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:11,668 INFO L356 Elim1Store]: treesize reduction 67, result has 40.7 percent of original size [2022-02-20 14:25:11,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2022-02-20 14:25:25,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:25,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,756 INFO L356 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2022-02-20 14:25:25,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 54 [2022-02-20 14:25:25,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,012 INFO L356 Elim1Store]: treesize reduction 63, result has 40.0 percent of original size [2022-02-20 14:25:26,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 124 [2022-02-20 14:25:26,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:26,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:25:26,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:25:26,203 INFO L356 Elim1Store]: treesize reduction 150, result has 23.1 percent of original size [2022-02-20 14:25:26,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 241 treesize of output 322