/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:26:05,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:26:05,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:26:05,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:26:05,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:26:05,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:26:05,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:26:05,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:26:05,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:26:05,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:26:05,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:26:05,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:26:05,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:26:05,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:26:05,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:26:05,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:26:05,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:26:05,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:26:05,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:26:05,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:26:05,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:26:05,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:26:05,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:26:05,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:26:05,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:26:05,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:26:05,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:26:05,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:26:05,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:26:05,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:26:05,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:26:05,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:26:05,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:26:05,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:26:05,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:26:05,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:26:05,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:26:05,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:26:05,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:26:05,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:26:05,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:26:05,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 20:26:05,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:26:05,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:26:05,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:26:05,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:26:05,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:26:05,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:26:05,274 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:26:05,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:26:05,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:26:05,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:26:05,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:26:05,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:26:05,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:26:05,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:26:05,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:26:05,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:26:05,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:26:05,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:26:05,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:26:05,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:26:05,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:26:05,282 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:26:05,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:26:05,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:26:05,283 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:26:05,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:26:05,285 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:26:05,285 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:26:05,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:26:05,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:26:05,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:26:05,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:26:05,507 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:26:05,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-01-10 20:26:05,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e450d60b8/9bd8410a2ab84cd490be42e9620f7553/FLAG9fcfd0a8b [2022-01-10 20:26:05,981 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:26:05,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-01-10 20:26:05,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e450d60b8/9bd8410a2ab84cd490be42e9620f7553/FLAG9fcfd0a8b [2022-01-10 20:26:06,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e450d60b8/9bd8410a2ab84cd490be42e9620f7553 [2022-01-10 20:26:06,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:26:06,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:26:06,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:26:06,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:26:06,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:26:06,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309cd034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06, skipping insertion in model container [2022-01-10 20:26:06,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:26:06,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:26:06,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-01-10 20:26:06,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:26:06,271 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:26:06,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-01-10 20:26:06,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:26:06,323 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:26:06,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06 WrapperNode [2022-01-10 20:26:06,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:26:06,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:26:06,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:26:06,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:26:06,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,379 INFO L137 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 136 [2022-01-10 20:26:06,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:26:06,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:26:06,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:26:06,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:26:06,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:26:06,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:26:06,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:26:06,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:26:06,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:06,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:26:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:06,472 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-01-10 20:26:06,491 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-01-10 20:26:06,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:26:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 20:26:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 20:26:06,635 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:26:06,636 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:26:06,886 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:26:06,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:26:06,892 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-10 20:26:06,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:26:06 BoogieIcfgContainer [2022-01-10 20:26:06,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:26:06,894 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:26:06,894 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:26:06,895 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:26:06,898 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:26:06" (1/1) ... [2022-01-10 20:26:07,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:26:07 BasicIcfg [2022-01-10 20:26:07,037 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:26:07,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:26:07,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:26:07,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:26:07,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:26:06" (1/4) ... [2022-01-10 20:26:07,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b849e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:26:07, skipping insertion in model container [2022-01-10 20:26:07,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:26:06" (2/4) ... [2022-01-10 20:26:07,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b849e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:26:07, skipping insertion in model container [2022-01-10 20:26:07,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:26:06" (3/4) ... [2022-01-10 20:26:07,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b849e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:26:07, skipping insertion in model container [2022-01-10 20:26:07,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:26:07" (4/4) ... [2022-01-10 20:26:07,053 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.cTransformedIcfg [2022-01-10 20:26:07,058 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:26:07,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 20:26:07,120 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:26:07,126 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-01-10 20:26:07,126 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 20:26:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:26:07,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:07,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:07,149 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:07,154 INFO L85 PathProgramCache]: Analyzing trace with hash 742652290, now seen corresponding path program 1 times [2022-01-10 20:26:07,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:07,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328271162] [2022-01-10 20:26:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:07,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:26:07,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:07,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328271162] [2022-01-10 20:26:07,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328271162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:26:07,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:26:07,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:26:07,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436563899] [2022-01-10 20:26:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:26:07,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 20:26:07,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:07,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 20:26:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 20:26:07,388 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:07,407 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2022-01-10 20:26:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 20:26:07,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 20:26:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:07,415 INFO L225 Difference]: With dead ends: 67 [2022-01-10 20:26:07,416 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 20:26:07,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 20:26:07,423 INFO L933 BasicCegarLoop]: 43 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, 43 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-01-10 20:26:07,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:26:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 20:26:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 20:26:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 20:26:07,459 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 23 [2022-01-10 20:26:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:07,460 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 20:26:07,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 20:26:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 20:26:07,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:07,463 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:07,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:26:07,463 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:07,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1342731011, now seen corresponding path program 1 times [2022-01-10 20:26:07,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:07,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873138090] [2022-01-10 20:26:07,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:07,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:26:08,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873138090] [2022-01-10 20:26:08,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873138090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:26:08,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:26:08,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 20:26:08,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683912612] [2022-01-10 20:26:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:26:08,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 20:26:08,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 20:26:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 20:26:08,139 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:08,450 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-01-10 20:26:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 20:26:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 20:26:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:08,451 INFO L225 Difference]: With dead ends: 53 [2022-01-10 20:26:08,451 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 20:26:08,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-01-10 20:26:08,453 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 119 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:08,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:26:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 20:26:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-10 20:26:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-10 20:26:08,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 23 [2022-01-10 20:26:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:08,463 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-10 20:26:08,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-10 20:26:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 20:26:08,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:08,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:08,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:26:08,469 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1996028901, now seen corresponding path program 1 times [2022-01-10 20:26:08,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:08,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594987812] [2022-01-10 20:26:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:08,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 20:26:08,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:08,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594987812] [2022-01-10 20:26:08,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594987812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:26:08,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:26:08,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 20:26:08,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092294846] [2022-01-10 20:26:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:26:08,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 20:26:08,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 20:26:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:26:08,888 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:09,166 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-01-10 20:26:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 20:26:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 20:26:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:09,169 INFO L225 Difference]: With dead ends: 60 [2022-01-10 20:26:09,169 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 20:26:09,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-10 20:26:09,172 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:09,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 57 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:26:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 20:26:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-01-10 20:26:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 20:26:09,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 25 [2022-01-10 20:26:09,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:09,195 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 20:26:09,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 20:26:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 20:26:09,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:09,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:09,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:26:09,197 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:09,198 INFO L85 PathProgramCache]: Analyzing trace with hash -405914394, now seen corresponding path program 1 times [2022-01-10 20:26:09,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:09,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176415309] [2022-01-10 20:26:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:09,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:26:10,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:10,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176415309] [2022-01-10 20:26:10,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176415309] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:26:10,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846113896] [2022-01-10 20:26:10,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:10,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:10,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:10,048 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-01-10 20:26:10,049 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-01-10 20:26:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:10,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 20:26:10,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:26:10,837 INFO L387 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 6 treesize of output 5 [2022-01-10 20:26:10,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 20:26:10,962 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 20:26:10,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 20:26:11,004 INFO L387 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 14 treesize of output 16 [2022-01-10 20:26:11,132 INFO L387 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 14 treesize of output 16 [2022-01-10 20:26:11,207 INFO L353 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2022-01-10 20:26:11,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-01-10 20:26:11,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-01-10 20:26:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:26:11,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:26:13,458 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616))))) is different from false [2022-01-10 20:26:13,558 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616))))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) is different from false [2022-01-10 20:26:13,599 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 20:26:13,651 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_48 (Array Int Int)) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_48) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_48 (Array Int Int)) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_48) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 20:26:13,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:13,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 92 [2022-01-10 20:26:13,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:13,902 INFO L387 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 174 treesize of output 176 [2022-01-10 20:26:13,912 INFO L387 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 187 [2022-01-10 20:26:13,921 INFO L387 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 190 treesize of output 186 [2022-01-10 20:26:14,428 INFO L387 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 4 [2022-01-10 20:26:16,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:16,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 170 [2022-01-10 20:26:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 20:26:17,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846113896] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:26:17,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:26:17,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 29 [2022-01-10 20:26:17,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559127469] [2022-01-10 20:26:17,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:26:17,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 20:26:17,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 20:26:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=499, Unknown=4, NotChecked=196, Total=812 [2022-01-10 20:26:17,464 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:26,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 1 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (and (or (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_#res#1Int| 0) (and (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_#res#1Int| 1) .cse0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|) .cse0 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.baseInt|) 0) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.offsetInt| 0) (or (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 0) (and .cse0 (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_~x#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse2 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse2 4) (* 18446744056529682432 (mod (div .cse2 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 0) (= |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0))) is different from false [2022-01-10 20:26:28,125 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 0)) is different from false [2022-01-10 20:26:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:28,671 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-01-10 20:26:28,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 20:26:28,672 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 20:26:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:28,673 INFO L225 Difference]: With dead ends: 71 [2022-01-10 20:26:28,673 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 20:26:28,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=277, Invalid=1146, Unknown=7, NotChecked=462, Total=1892 [2022-01-10 20:26:28,675 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:28,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 284 Invalid, 0 Unknown, 229 Unchecked, 0.6s Time] [2022-01-10 20:26:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 20:26:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2022-01-10 20:26:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-01-10 20:26:28,690 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 27 [2022-01-10 20:26:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:28,691 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-01-10 20:26:28,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-01-10 20:26:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 20:26:28,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:28,695 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2022-01-10 20:26:28,706 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-01-10 20:26:28,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:28,902 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:28,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 880007432, now seen corresponding path program 2 times [2022-01-10 20:26:28,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:28,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672599228] [2022-01-10 20:26:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:28,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:26:29,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:29,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672599228] [2022-01-10 20:26:29,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672599228] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:26:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211041883] [2022-01-10 20:26:29,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 20:26:29,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:29,114 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-01-10 20:26:29,115 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-01-10 20:26:29,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 20:26:29,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 20:26:29,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-10 20:26:29,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:26:29,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-01-10 20:26:29,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 20:26:29,862 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:29,863 INFO L387 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 66 treesize of output 23 [2022-01-10 20:26:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 20:26:29,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 20:26:29,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211041883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:26:29,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 20:26:29,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2022-01-10 20:26:29,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460802741] [2022-01-10 20:26:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:26:29,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 20:26:29,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 20:26:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-01-10 20:26:29,917 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:31,038 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-01-10 20:26:31,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 20:26:31,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 20:26:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:31,041 INFO L225 Difference]: With dead ends: 105 [2022-01-10 20:26:31,041 INFO L226 Difference]: Without dead ends: 103 [2022-01-10 20:26:31,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-01-10 20:26:31,043 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 237 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:31,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 20:26:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-10 20:26:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-01-10 20:26:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2022-01-10 20:26:31,066 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 29 [2022-01-10 20:26:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:31,067 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2022-01-10 20:26:31,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-01-10 20:26:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 20:26:31,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:31,068 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2022-01-10 20:26:31,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 20:26:31,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:31,273 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash -252916229, now seen corresponding path program 1 times [2022-01-10 20:26:31,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:31,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812735717] [2022-01-10 20:26:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:31,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 20:26:31,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812735717] [2022-01-10 20:26:31,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812735717] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:26:31,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235369729] [2022-01-10 20:26:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:31,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:31,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:31,421 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-01-10 20:26:31,453 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-01-10 20:26:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:31,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 20:26:31,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:26:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:26:32,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:26:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:26:32,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235369729] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:26:32,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:26:32,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 21 [2022-01-10 20:26:32,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937878524] [2022-01-10 20:26:32,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:26:32,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 20:26:32,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 20:26:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-01-10 20:26:32,612 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:35,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:26:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:35,967 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2022-01-10 20:26:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 20:26:35,968 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 20:26:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:35,968 INFO L225 Difference]: With dead ends: 134 [2022-01-10 20:26:35,969 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 20:26:35,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2022-01-10 20:26:35,970 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 382 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:35,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 383 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 301 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-01-10 20:26:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 20:26:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 61. [2022-01-10 20:26:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-01-10 20:26:36,005 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 30 [2022-01-10 20:26:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:36,006 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-01-10 20:26:36,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-01-10 20:26:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 20:26:36,012 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:36,012 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:36,022 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-01-10 20:26:36,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:36,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1390122208, now seen corresponding path program 1 times [2022-01-10 20:26:36,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636073907] [2022-01-10 20:26:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:36,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 20:26:36,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:36,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636073907] [2022-01-10 20:26:36,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636073907] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:26:36,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877557298] [2022-01-10 20:26:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:36,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:36,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:36,455 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-01-10 20:26:36,456 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-01-10 20:26:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:36,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 20:26:36,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:26:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:26:36,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:26:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:26:40,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877557298] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:26:40,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:26:40,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-01-10 20:26:40,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801474191] [2022-01-10 20:26:40,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:26:40,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 20:26:40,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:40,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 20:26:40,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=228, Unknown=1, NotChecked=0, Total=272 [2022-01-10 20:26:40,362 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:42,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:26:44,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:26:47,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 20:26:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:47,523 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2022-01-10 20:26:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 20:26:47,524 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 20:26:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:47,524 INFO L225 Difference]: With dead ends: 117 [2022-01-10 20:26:47,524 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 20:26:47,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=161, Invalid=594, Unknown=1, NotChecked=0, Total=756 [2022-01-10 20:26:47,526 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 172 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:47,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 250 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 149 Invalid, 3 Unknown, 35 Unchecked, 6.6s Time] [2022-01-10 20:26:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 20:26:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-01-10 20:26:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2022-01-10 20:26:47,550 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 31 [2022-01-10 20:26:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:47,550 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2022-01-10 20:26:47,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-01-10 20:26:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 20:26:47,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:47,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:47,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 20:26:47,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:47,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1620300835, now seen corresponding path program 1 times [2022-01-10 20:26:47,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:47,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821570427] [2022-01-10 20:26:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:47,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:26:47,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821570427] [2022-01-10 20:26:47,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821570427] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:26:47,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:26:47,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:26:47,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22571359] [2022-01-10 20:26:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:26:47,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:26:47,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:26:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:26:47,881 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:26:48,067 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-01-10 20:26:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 20:26:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 20:26:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:26:48,068 INFO L225 Difference]: With dead ends: 94 [2022-01-10 20:26:48,068 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 20:26:48,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:26:48,069 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:26:48,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:26:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 20:26:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-01-10 20:26:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-01-10 20:26:48,094 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2022-01-10 20:26:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:26:48,094 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-01-10 20:26:48,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:26:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-01-10 20:26:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 20:26:48,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:26:48,095 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:26:48,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:26:48,095 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:26:48,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:26:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -954412500, now seen corresponding path program 1 times [2022-01-10 20:26:48,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:26:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333684446] [2022-01-10 20:26:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:48,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:26:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 20:26:48,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:26:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333684446] [2022-01-10 20:26:48,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333684446] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:26:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478726613] [2022-01-10 20:26:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:26:48,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:26:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:26:48,272 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-01-10 20:26:48,299 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-01-10 20:26:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:26:48,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-10 20:26:48,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:26:49,198 INFO L387 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 6 treesize of output 5 [2022-01-10 20:26:49,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 20:26:49,361 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 20:26:49,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 20:26:49,437 INFO L387 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 18 treesize of output 20 [2022-01-10 20:26:49,611 INFO L387 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 18 treesize of output 20 [2022-01-10 20:26:49,863 INFO L353 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2022-01-10 20:26:49,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-01-10 20:26:50,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 20:26:50,033 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:50,034 INFO L387 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 40 treesize of output 23 [2022-01-10 20:26:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 20:26:50,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:26:52,204 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 20:26:52,300 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) is different from false [2022-01-10 20:26:52,332 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))))) is different from false [2022-01-10 20:26:52,371 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 20:26:52,564 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:52,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 92 [2022-01-10 20:26:52,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:52,577 INFO L387 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 174 treesize of output 176 [2022-01-10 20:26:52,584 INFO L387 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 187 [2022-01-10 20:26:52,596 INFO L387 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 190 treesize of output 186 [2022-01-10 20:26:52,615 INFO L387 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 4 [2022-01-10 20:26:58,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 20:26:58,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 222 [2022-01-10 20:26:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-01-10 20:26:59,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478726613] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:26:59,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:26:59,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 11] total 32 [2022-01-10 20:26:59,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756840636] [2022-01-10 20:26:59,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:26:59,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 20:26:59,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:26:59,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 20:26:59,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=650, Unknown=4, NotChecked=220, Total=992 [2022-01-10 20:26:59,047 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:27:01,722 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (= |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) is different from false [2022-01-10 20:27:03,776 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|)) is different from false [2022-01-10 20:27:05,795 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt|)) (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0)) is different from false [2022-01-10 20:27:07,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 4294967296) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 1)) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 20:27:09,808 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (<= (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 1 (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 4294967296)) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648) 4294967296))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 20:27:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:27:10,268 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-01-10 20:27:10,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 20:27:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 20:27:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:27:10,269 INFO L225 Difference]: With dead ends: 151 [2022-01-10 20:27:10,269 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 20:27:10,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=244, Invalid=1343, Unknown=9, NotChecked=756, Total=2352 [2022-01-10 20:27:10,271 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 20:27:10,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 244 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 201 Unchecked, 0.5s Time] [2022-01-10 20:27:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 20:27:10,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2022-01-10 20:27:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.28) internal successors, (128), 100 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:27:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2022-01-10 20:27:10,310 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 31 [2022-01-10 20:27:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:27:10,310 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2022-01-10 20:27:10,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:27:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-01-10 20:27:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 20:27:10,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:27:10,311 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-01-10 20:27:10,331 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-01-10 20:27:10,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:27:10,515 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:27:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:27:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash 814515082, now seen corresponding path program 2 times [2022-01-10 20:27:10,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:27:10,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421811760] [2022-01-10 20:27:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:27:10,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:27:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:27:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 20:27:10,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:27:10,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421811760] [2022-01-10 20:27:10,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421811760] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:27:10,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911448175] [2022-01-10 20:27:10,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 20:27:10,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:27:10,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:27:10,724 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-01-10 20:27:10,728 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-01-10 20:27:11,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 20:27:11,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 20:27:11,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 20:27:11,511 INFO L286 TraceCheckSpWp]: Computing forward predicates...