/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_BITWISE.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:50:58,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:50:58,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:50:58,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:50:58,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:50:58,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:50:58,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:50:58,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:50:58,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:50:58,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:50:58,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:50:58,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:50:58,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:50:58,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:50:58,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:50:58,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:50:58,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:50:58,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:50:58,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:50:58,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:50:58,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:50:58,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:50:58,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:50:58,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:50:58,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:50:58,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:50:58,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:50:58,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:50:58,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:50:58,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:50:58,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:50:58,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:50:58,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:50:58,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:50:58,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:50:58,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:50:58,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:50:58,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:50:58,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:50:58,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:50:58,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:50:58,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:50:58,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:50:58,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:50:58,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:50:58,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:50:58,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:50:58,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:50:58,389 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:50:58,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:50:58,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:50:58,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:50:58,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:50:58,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:50:58,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:50:58,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:50:58,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:50:58,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:50:58,398 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:50:58,398 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:50:58,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:50:58,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:50:58,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:50:58,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:50:58,617 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:50:58,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 11:50:58,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be2f30e0/c25b02acdf0e46519b09b3431a04a208/FLAGcf4ec1b18 [2022-01-10 11:50:59,110 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:50:59,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 11:50:59,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be2f30e0/c25b02acdf0e46519b09b3431a04a208/FLAGcf4ec1b18 [2022-01-10 11:50:59,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be2f30e0/c25b02acdf0e46519b09b3431a04a208 [2022-01-10 11:50:59,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:50:59,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:50:59,470 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:50:59,470 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:50:59,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:50:59,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2198dcb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59, skipping insertion in model container [2022-01-10 11:50:59,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:50:59,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:50:59,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2022-01-10 11:50:59,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:50:59,789 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:50:59,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2022-01-10 11:50:59,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:50:59,846 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:50:59,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59 WrapperNode [2022-01-10 11:50:59,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:50:59,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:50:59,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:50:59,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:50:59,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,895 INFO L137 Inliner]: procedures = 127, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-01-10 11:50:59,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:50:59,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:50:59,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:50:59,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:50:59,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:50:59,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:50:59,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:50:59,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:50:59,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (1/1) ... [2022-01-10 11:50:59,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:50:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:50:59,970 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 11:50:59,975 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 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:50:59,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:50:59,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:51:00,067 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:51:00,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:51:00,271 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:51:00,275 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:51:00,275 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 11:51:00,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:00 BoogieIcfgContainer [2022-01-10 11:51:00,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:51:00,276 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:51:00,277 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:51:00,278 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:51:00,280 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:00" (1/1) ... [2022-01-10 11:51:00,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:51:00 BasicIcfg [2022-01-10 11:51:00,368 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:51:00,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:51:00,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:51:00,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:51:00,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:50:59" (1/4) ... [2022-01-10 11:51:00,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc900af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:51:00, skipping insertion in model container [2022-01-10 11:51:00,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:50:59" (2/4) ... [2022-01-10 11:51:00,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc900af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:51:00, skipping insertion in model container [2022-01-10 11:51:00,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:00" (3/4) ... [2022-01-10 11:51:00,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc900af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:51:00, skipping insertion in model container [2022-01-10 11:51:00,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:51:00" (4/4) ... [2022-01-10 11:51:00,373 INFO L111 eAbstractionObserver]: Analyzing ICFG alternating_list-1.iTransformedIcfg [2022-01-10 11:51:00,376 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:51:00,376 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:51:00,403 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:51:00,407 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 11:51:00,408 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:51:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 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 11:51:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 11:51:00,419 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:00,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:00,420 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1665253908, now seen corresponding path program 1 times [2022-01-10 11:51:00,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:00,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433345066] [2022-01-10 11:51:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:00,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:00,605 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 11:51:00,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:00,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433345066] [2022-01-10 11:51:00,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433345066] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:00,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:00,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:51:00,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217236071] [2022-01-10 11:51:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:00,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:51:00,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:00,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:51:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:51:00,653 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:00,670 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-01-10 11:51:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:51:00,672 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 11:51:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:00,678 INFO L225 Difference]: With dead ends: 43 [2022-01-10 11:51:00,678 INFO L226 Difference]: Without dead ends: 18 [2022-01-10 11:51:00,680 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 11:51:00,683 INFO L933 BasicCegarLoop]: 34 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, 34 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 11:51:00,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-10 11:51:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-10 11:51:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 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 11:51:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-01-10 11:51:00,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-01-10 11:51:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:00,715 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-01-10 11:51:00,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-01-10 11:51:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 11:51:00,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:00,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:00,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:51:00,716 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash -777750227, now seen corresponding path program 1 times [2022-01-10 11:51:00,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:00,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245003598] [2022-01-10 11:51:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:00,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:00,831 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 11:51:00,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:00,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245003598] [2022-01-10 11:51:00,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245003598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:00,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:00,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:51:00,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790197715] [2022-01-10 11:51:00,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:00,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:51:00,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:00,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:51:00,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:51:00,833 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:00,899 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-01-10 11:51:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:51:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 11:51:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:00,901 INFO L225 Difference]: With dead ends: 42 [2022-01-10 11:51:00,901 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:51:00,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:51:00,904 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:00,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:51:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-01-10 11:51:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 11:51:00,908 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-01-10 11:51:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:00,908 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 11:51:00,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 11:51:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 11:51:00,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:00,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:00,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:51:00,909 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:00,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:00,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1667361497, now seen corresponding path program 1 times [2022-01-10 11:51:00,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486869667] [2022-01-10 11:51:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:00,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:01,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486869667] [2022-01-10 11:51:01,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486869667] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510861737] [2022-01-10 11:51:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:01,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:01,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:01,200 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 11:51:01,215 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 11:51:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:01,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 11:51:01,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:01,411 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 11 treesize of output 7 [2022-01-10 11:51:01,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:01,495 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 23 treesize of output 22 [2022-01-10 11:51:01,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:01,543 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 11:51:01,543 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 19 treesize of output 22 [2022-01-10 11:51:01,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:01,684 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:01,684 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 22 treesize of output 14 [2022-01-10 11:51:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:01,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:02,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 11:51:04,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 1) (< 0 .cse0)) (= 3 .cse0)))) is different from false [2022-01-10 11:51:06,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= .cse0 3)))) is different from false [2022-01-10 11:51:06,549 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 829 treesize of output 805 [2022-01-10 11:51:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 11:51:07,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510861737] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:07,956 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:07,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2022-01-10 11:51:07,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954088869] [2022-01-10 11:51:07,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:07,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 11:51:07,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 11:51:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=410, Unknown=3, NotChecked=132, Total=650 [2022-01-10 11:51:07,958 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 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 11:51:09,301 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= .cse0 3))))) is different from false [2022-01-10 11:51:11,331 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 1) (< 0 .cse0)) (= 3 .cse0)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-10 11:51:12,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select .cse1 0) 1) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 11:51:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:12,537 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-01-10 11:51:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 11:51:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 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) Word has length 16 [2022-01-10 11:51:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:12,538 INFO L225 Difference]: With dead ends: 70 [2022-01-10 11:51:12,538 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 11:51:12,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=142, Invalid=578, Unknown=6, NotChecked=330, Total=1056 [2022-01-10 11:51:12,540 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:12,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 246 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 194 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2022-01-10 11:51:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 11:51:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 29. [2022-01-10 11:51:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 11:51:12,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2022-01-10 11:51:12,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:12,544 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 11:51:12,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 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 11:51:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 11:51:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 11:51:12,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:12,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:12,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 11:51:12,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:12,746 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1667360474, now seen corresponding path program 1 times [2022-01-10 11:51:12,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065206107] [2022-01-10 11:51:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:12,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:12,815 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 11:51:12,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:12,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065206107] [2022-01-10 11:51:12,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065206107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:12,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:12,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:51:12,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971189897] [2022-01-10 11:51:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:12,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:51:12,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:51:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:51:12,818 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:12,837 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-01-10 11:51:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:51:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 11:51:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:12,839 INFO L225 Difference]: With dead ends: 55 [2022-01-10 11:51:12,839 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 11:51:12,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:51:12,842 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:12,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 11:51:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-10 11:51:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-10 11:51:12,846 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 16 [2022-01-10 11:51:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:12,846 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-10 11:51:12,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-10 11:51:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:51:12,847 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:12,847 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:12,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:51:12,847 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -323034325, now seen corresponding path program 1 times [2022-01-10 11:51:12,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590216922] [2022-01-10 11:51:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:12,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:51:12,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590216922] [2022-01-10 11:51:12,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590216922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:12,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:12,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:51:12,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363264128] [2022-01-10 11:51:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:12,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:51:12,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:12,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:51:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:51:12,935 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:12,950 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-01-10 11:51:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:51:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:51:12,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:12,950 INFO L225 Difference]: With dead ends: 64 [2022-01-10 11:51:12,951 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 11:51:12,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:51:12,951 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:12,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 11:51:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-10 11:51:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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 11:51:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 11:51:12,955 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-01-10 11:51:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:12,955 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 11:51:12,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 11:51:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:51:12,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:12,956 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:12,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:51:12,956 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:12,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -323033302, now seen corresponding path program 1 times [2022-01-10 11:51:12,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:12,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476550443] [2022-01-10 11:51:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:12,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:13,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:13,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476550443] [2022-01-10 11:51:13,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476550443] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:13,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353876497] [2022-01-10 11:51:13,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:13,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:13,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:13,220 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 11:51:13,221 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 11:51:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:13,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 11:51:13,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:13,421 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 11:51:13,428 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 11:51:13,486 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:13,487 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2022-01-10 11:51:13,491 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 31 treesize of output 21 [2022-01-10 11:51:13,506 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 11:51:13,506 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 45 treesize of output 55 [2022-01-10 11:51:13,513 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 29 treesize of output 17 [2022-01-10 11:51:13,546 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 31 treesize of output 19 [2022-01-10 11:51:13,555 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 23 treesize of output 11 [2022-01-10 11:51:13,735 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 35 treesize of output 19 [2022-01-10 11:51:13,741 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 38 treesize of output 14 [2022-01-10 11:51:13,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:13,793 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:13,794 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 22 treesize of output 14 [2022-01-10 11:51:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:13,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:13,958 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:13,959 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 106 treesize of output 109 [2022-01-10 11:51:14,076 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,076 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 53 treesize of output 54 [2022-01-10 11:51:14,083 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,084 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 54 treesize of output 54 [2022-01-10 11:51:14,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,096 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 70 treesize of output 73 [2022-01-10 11:51:14,107 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,108 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 89 treesize of output 92 [2022-01-10 11:51:14,115 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 45 treesize of output 39 [2022-01-10 11:51:14,120 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 39 treesize of output 33 [2022-01-10 11:51:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:14,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353876497] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:14,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:14,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2022-01-10 11:51:14,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813330904] [2022-01-10 11:51:14,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:14,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 11:51:14,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:14,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 11:51:14,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-01-10 11:51:14,306 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 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 11:51:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:14,820 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-01-10 11:51:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 11:51:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:51:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:14,821 INFO L225 Difference]: With dead ends: 64 [2022-01-10 11:51:14,821 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 11:51:14,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 11:51:14,822 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:14,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 157 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 235 Invalid, 0 Unknown, 16 Unchecked, 0.2s Time] [2022-01-10 11:51:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 11:51:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2022-01-10 11:51:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-10 11:51:14,825 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2022-01-10 11:51:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:14,825 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-10 11:51:14,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 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 11:51:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-10 11:51:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:51:14,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:14,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:14,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:15,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 11:51:15,035 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2081581010, now seen corresponding path program 1 times [2022-01-10 11:51:15,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:15,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244510375] [2022-01-10 11:51:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:15,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:15,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:15,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244510375] [2022-01-10 11:51:15,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244510375] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:15,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594960148] [2022-01-10 11:51:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:15,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:15,338 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 11:51:15,353 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 11:51:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:15,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 11:51:15,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:15,509 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 11:51:15,552 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 11 treesize of output 7 [2022-01-10 11:51:15,579 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:15,579 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 13 treesize of output 13 [2022-01-10 11:51:15,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:15,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 11:51:15,639 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 11:51:15,695 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 11:51:15,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:15,731 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 11:51:15,731 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 19 treesize of output 22 [2022-01-10 11:51:15,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:15,822 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:15,822 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 22 treesize of output 14 [2022-01-10 11:51:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:15,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:17,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 11:51:17,309 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= 3 .cse0)))) is different from false [2022-01-10 11:51:17,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0))))) is different from false [2022-01-10 11:51:17,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_243 Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_243)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 11:51:17,512 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 11:51:17,513 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 2 case distinctions, treesize of input 155 treesize of output 85 [2022-01-10 11:51:17,526 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:17,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 397 [2022-01-10 11:51:17,540 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 393 treesize of output 369 [2022-01-10 11:51:17,593 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 6 treesize of output 4 [2022-01-10 11:51:17,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:17,766 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 21 treesize of output 25 [2022-01-10 11:51:17,827 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 6 treesize of output 4 [2022-01-10 11:51:17,844 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:17,844 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 21 treesize of output 25 [2022-01-10 11:51:17,881 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 6 treesize of output 4 [2022-01-10 11:51:17,902 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:17,929 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:17,930 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 21 treesize of output 25 [2022-01-10 11:51:17,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:17,974 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 5 treesize of output 3 [2022-01-10 11:51:17,999 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 6 treesize of output 4 [2022-01-10 11:51:18,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,022 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,033 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,063 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,075 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,093 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,123 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,131 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,133 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,171 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,196 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,242 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,252 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,294 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,301 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,376 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 6 treesize of output 4 [2022-01-10 11:51:18,400 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 6 treesize of output 4 [2022-01-10 11:51:18,452 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:18,454 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 29 treesize of output 33 [2022-01-10 11:51:18,541 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:18,542 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 29 treesize of output 33 [2022-01-10 11:51:18,598 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 6 treesize of output 4 [2022-01-10 11:51:18,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,625 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:18,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:18,651 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:19,124 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 21 treesize of output 25 [2022-01-10 11:51:19,177 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 6 treesize of output 4 [2022-01-10 11:51:19,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,204 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,221 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,249 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,311 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:19,311 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 29 treesize of output 33 [2022-01-10 11:51:19,395 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,679 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,709 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,753 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,772 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,789 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,806 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,827 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:19,907 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 11:51:20,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:20,060 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 240 treesize of output 222 [2022-01-10 11:51:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-10 11:51:20,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594960148] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:20,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:20,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-01-10 11:51:20,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146134277] [2022-01-10 11:51:20,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:20,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 11:51:20,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:20,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 11:51:20,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=681, Unknown=6, NotChecked=228, Total=1056 [2022-01-10 11:51:20,454 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 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 11:51:20,513 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0)))))) is different from false [2022-01-10 11:51:20,516 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0)))))) is different from false [2022-01-10 11:51:20,518 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= 3 .cse0)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 11:51:21,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 11:51:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:21,546 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-10 11:51:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 11:51:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:51:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:21,547 INFO L225 Difference]: With dead ends: 45 [2022-01-10 11:51:21,547 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 11:51:21,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=169, Invalid=723, Unknown=10, NotChecked=504, Total=1406 [2022-01-10 11:51:21,548 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:21,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 102 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2022-01-10 11:51:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 11:51:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 11:51:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 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 11:51:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-10 11:51:21,554 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2022-01-10 11:51:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:21,555 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-10 11:51:21,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 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 11:51:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-10 11:51:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 11:51:21,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:21,556 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:21,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 11:51:21,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:21,772 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -711249789, now seen corresponding path program 1 times [2022-01-10 11:51:21,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:21,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223709616] [2022-01-10 11:51:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:21,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:22,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223709616] [2022-01-10 11:51:22,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223709616] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165226495] [2022-01-10 11:51:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:22,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:22,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:22,104 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 11:51:22,137 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 11:51:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:22,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-10 11:51:22,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:22,407 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 11:51:22,414 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 11:51:22,462 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-10 11:51:22,462 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 34 treesize of output 25 [2022-01-10 11:51:22,470 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 11 treesize of output 7 [2022-01-10 11:51:22,480 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:22,480 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 18 treesize of output 24 [2022-01-10 11:51:22,504 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 9 treesize of output 3 [2022-01-10 11:51:22,637 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:22,638 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 22 treesize of output 28 [2022-01-10 11:51:22,642 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 19 treesize of output 18 [2022-01-10 11:51:22,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:22,655 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:51:22,658 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 23 treesize of output 22 [2022-01-10 11:51:22,767 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:22,768 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 69 treesize of output 71 [2022-01-10 11:51:22,802 INFO L353 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-01-10 11:51:22,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 97 [2022-01-10 11:51:22,838 INFO L353 Elim1Store]: treesize reduction 52, result has 48.5 percent of original size [2022-01-10 11:51:22,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 80 [2022-01-10 11:51:23,151 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 15 treesize of output 11 [2022-01-10 11:51:23,173 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 15 treesize of output 11 [2022-01-10 11:51:23,297 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 11:51:23,303 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 44 treesize of output 26 [2022-01-10 11:51:23,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:23,413 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2022-01-10 11:51:23,798 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 78 treesize of output 38 [2022-01-10 11:51:23,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:23,803 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:51:23,803 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 60 treesize of output 36 [2022-01-10 11:51:23,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:23,983 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 11:51:23,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2022-01-10 11:51:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:23,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:26,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_339 (Array Int Int))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))) (let ((.cse1 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) .cse0))) (or (not (<= 0 .cse0)) (= .cse1 2) (= .cse1 3)))))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) is different from false [2022-01-10 11:51:26,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse5 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 v_ArrVal_335)))) (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3)))) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (let ((.cse1 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3)) .cse0))) (or (not (<= 0 .cse0)) (= 2 .cse1) (= 3 .cse1) (not (= (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) is different from false [2022-01-10 11:51:26,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse5 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 v_ArrVal_335)))) (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) 0 3)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (let ((.cse0 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3)) .cse1))) (or (= .cse0 3) (= .cse0 2) (not (<= 0 .cse1)) (not (= (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) is different from false [2022-01-10 11:51:26,536 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:26,536 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 2623 treesize of output 2490 [2022-01-10 11:51:33,424 INFO L353 Elim1Store]: treesize reduction 92, result has 41.0 percent of original size [2022-01-10 11:51:33,425 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 3 case distinctions, treesize of input 754 treesize of output 544 [2022-01-10 11:51:33,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:33,463 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 465 treesize of output 358 [2022-01-10 11:51:33,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:33,481 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 1947 treesize of output 1198 [2022-01-10 11:51:33,492 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 1123 treesize of output 1099 [2022-01-10 11:51:33,503 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 1099 treesize of output 1051 [2022-01-10 11:51:33,556 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:33,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1243 treesize of output 1228 [2022-01-10 11:51:33,576 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 1132 treesize of output 1090 [2022-01-10 11:51:33,588 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 1071 treesize of output 1047 [2022-01-10 11:51:33,605 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 1047 treesize of output 1041 [2022-01-10 11:51:33,618 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 1041 treesize of output 1029 [2022-01-10 11:51:33,630 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 1029 treesize of output 1017 [2022-01-10 11:51:33,642 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 1017 treesize of output 993 [2022-01-10 11:51:33,654 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 993 treesize of output 981 [2022-01-10 11:51:33,665 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 981 treesize of output 969 [2022-01-10 11:51:33,677 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 969 treesize of output 945 [2022-01-10 11:51:33,688 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 945 treesize of output 921 [2022-01-10 11:51:33,700 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 921 treesize of output 873 [2022-01-10 11:51:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-10 11:51:35,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165226495] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:35,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:35,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 37 [2022-01-10 11:51:35,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206140148] [2022-01-10 11:51:35,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:35,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 11:51:35,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 11:51:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=966, Unknown=24, NotChecked=198, Total=1332 [2022-01-10 11:51:35,312 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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 11:51:35,501 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse1 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (or .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 .cse2))) (not .cse0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 4)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse5 (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 v_ArrVal_335)))) (store .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) 0 3)))) (.cse4 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse3 (select (select .cse5 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse4))) (or (= .cse3 3) (= .cse3 2) (not (<= 0 .cse4)) (not (= (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) (= (select .cse9 4) 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select .cse9 .cse2)))) is different from false [2022-01-10 11:51:35,507 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse1 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (or .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 .cse2))) (not .cse0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 4)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse5 (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 v_ArrVal_335)))) (store .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3)))) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse4 (select (select .cse5 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse3))) (or (not (<= 0 .cse3)) (= 2 .cse4) (= 3 .cse4) (not (= (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select .cse9 4) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select .cse9 .cse2)))) is different from false [2022-01-10 11:51:37,511 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (let ((.cse0 (select .cse9 4)) (.cse3 (select .cse1 4)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= 2 (select (select |c_#memory_intInt| .cse0) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select .cse1 .cse2) 0) (= .cse3 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse0)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_339 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse5 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse4))) (or (not (<= 0 .cse4)) (= .cse5 2) (= .cse5 3)))))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) (or (and (= .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0))) (let ((.cse7 (select .cse9 .cse2))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offsetInt| .cse7) 4))) (and (= 2 (select (select |c_#memory_intInt| .cse7) 0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse8) (= .cse8 0)))))))) is different from false [2022-01-10 11:51:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:37,811 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-01-10 11:51:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 11:51:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-01-10 11:51:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:37,812 INFO L225 Difference]: With dead ends: 50 [2022-01-10 11:51:37,812 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 11:51:37,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=219, Invalid=1496, Unknown=31, NotChecked=510, Total=2256 [2022-01-10 11:51:37,813 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:37,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2022-01-10 11:51:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 11:51:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 11:51:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 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 11:51:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-10 11:51:37,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2022-01-10 11:51:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:37,817 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-10 11:51:37,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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 11:51:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-10 11:51:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 11:51:37,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:37,817 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:37,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 11:51:38,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:38,018 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -672846138, now seen corresponding path program 2 times [2022-01-10 11:51:38,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:38,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606100937] [2022-01-10 11:51:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:38,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:38,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:38,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606100937] [2022-01-10 11:51:38,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606100937] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:38,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22844832] [2022-01-10 11:51:38,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:38,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:38,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:38,292 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 11:51:38,293 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 11:51:38,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:38,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:38,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-10 11:51:38,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:38,461 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 11:51:38,533 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 11 treesize of output 7 [2022-01-10 11:51:38,586 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:38,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 11:51:38,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:38,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 11:51:38,723 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 11:51:38,755 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 11:51:38,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 35 [2022-01-10 11:51:38,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 11:51:38,902 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 11:51:38,934 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 11:51:38,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 11:51:38,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 11:51:39,026 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 11:51:39,064 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 15 treesize of output 7 [2022-01-10 11:51:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:39,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:39,125 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_457 (Array Int Int))) (< 0 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (forall ((v_ArrVal_457 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 11:51:39,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 11:51:39,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))))) is different from false [2022-01-10 11:51:39,949 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_16| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (let ((.cse0 (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_16| 1))) (or (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_446 Int)) (<= (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_446)) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_16| v_ArrVal_451) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_446 Int)) (< 0 (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_446)) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_16| v_ArrVal_451) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_16|) 2) 0)) (not (<= (mod (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15|) 2) 0)) (not (<= (mod (select (store .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0))))) is different from false [2022-01-10 11:51:39,984 INFO L353 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2022-01-10 11:51:39,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 74 [2022-01-10 11:51:40,016 INFO L353 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2022-01-10 11:51:40,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 534 [2022-01-10 11:51:40,053 INFO L353 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2022-01-10 11:51:40,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 752 treesize of output 758 [2022-01-10 11:51:40,068 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 689 treesize of output 673 [2022-01-10 11:51:40,078 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 673 treesize of output 665 [2022-01-10 11:51:40,087 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 665 treesize of output 661 [2022-01-10 11:51:40,096 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 661 treesize of output 653 [2022-01-10 11:51:40,106 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 653 treesize of output 621 [2022-01-10 11:51:40,115 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 621 treesize of output 605 [2022-01-10 11:51:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 14 not checked. [2022-01-10 11:51:41,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22844832] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:41,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:41,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2022-01-10 11:51:41,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620250554] [2022-01-10 11:51:41,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:41,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-10 11:51:41,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-10 11:51:41,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=756, Unknown=13, NotChecked=244, Total=1190 [2022-01-10 11:51:41,608 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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 11:51:47,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15|) 2) 0)) (not (<= (mod (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_446 Int)) (< 0 (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_446)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_451) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int)) (v_ArrVal_446 Int)) (<= (select (select (store (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_446)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_451) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_15| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))) (= (select .cse0 0) 1) (= (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (exists ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_36| Int)) (and (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_36|) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_36|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_36|)))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1))) is different from false [2022-01-10 11:51:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:47,393 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-10 11:51:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 11:51:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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 26 [2022-01-10 11:51:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:47,394 INFO L225 Difference]: With dead ends: 55 [2022-01-10 11:51:47,394 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 11:51:47,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=227, Invalid=965, Unknown=18, NotChecked=350, Total=1560 [2022-01-10 11:51:47,395 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:47,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 137 Invalid, 0 Unknown, 196 Unchecked, 0.1s Time] [2022-01-10 11:51:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 11:51:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-01-10 11:51:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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 11:51:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-01-10 11:51:47,400 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 26 [2022-01-10 11:51:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:47,400 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-01-10 11:51:47,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 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 11:51:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-01-10 11:51:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 11:51:47,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:47,400 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:47,422 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 11:51:47,614 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 11:51:47,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2042134863, now seen corresponding path program 1 times [2022-01-10 11:51:47,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:47,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735419688] [2022-01-10 11:51:47,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:47,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:48,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735419688] [2022-01-10 11:51:48,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735419688] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:48,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193584677] [2022-01-10 11:51:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:48,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:48,059 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 11:51:48,085 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 11:51:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:48,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-10 11:51:48,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:48,317 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 11:51:48,402 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:48,403 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 13 treesize of output 13 [2022-01-10 11:51:48,450 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 11:51:48,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 11:51:48,514 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:48,515 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 29 treesize of output 33 [2022-01-10 11:51:48,519 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 19 treesize of output 7 [2022-01-10 11:51:48,540 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:48,541 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 30 treesize of output 30 [2022-01-10 11:51:48,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:48,641 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:51:48,641 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 99 [2022-01-10 11:51:48,644 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2022-01-10 11:51:48,736 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-10 11:51:48,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 166 [2022-01-10 11:51:48,785 INFO L353 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-01-10 11:51:48,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 176 [2022-01-10 11:51:48,790 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 47 treesize of output 31 [2022-01-10 11:51:48,802 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 47 treesize of output 23 [2022-01-10 11:51:48,829 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 83 treesize of output 35 [2022-01-10 11:51:48,852 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 61 treesize of output 37 [2022-01-10 11:51:48,879 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 76 treesize of output 40 [2022-01-10 11:51:48,904 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 76 treesize of output 40 [2022-01-10 11:51:48,967 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 103 treesize of output 73 [2022-01-10 11:51:49,031 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 64 treesize of output 34 [2022-01-10 11:51:50,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:50,139 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:51:50,140 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 83 [2022-01-10 11:51:50,159 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 11:51:50,160 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 31 [2022-01-10 11:51:50,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:50,223 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 11:51:50,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2022-01-10 11:51:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:50,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:50,654 INFO L353 Elim1Store]: treesize reduction 33, result has 84.3 percent of original size [2022-01-10 11:51:50,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 522 treesize of output 528 [2022-01-10 11:51:54,170 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_543)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse4 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_542))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse5 (mod (+ .cse2 4) 18446744073709551616))) (let ((.cse1 (select (select .cse6 .cse3) .cse5)) (.cse0 (select (select .cse4 .cse3) .cse5))) (or (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse0) (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= .cse1 .cse2) (= .cse3 .cse0)) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) (and (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse3)) (and (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse0))))))))) is different from false [2022-01-10 11:52:01,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_543)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse6 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_542))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse5 (mod (+ .cse0 4) 18446744073709551616))) (let ((.cse3 (select (select .cse6 .cse1) .cse5)) (.cse2 (select (select .cse4 .cse1) .cse5))) (or (and (= .cse0 0) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse1)) (and (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= .cse1 .cse3) (= .cse2 .cse0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse3)) (and (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse3) (= .cse2 0)) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))))))))) is different from false [2022-01-10 11:52:01,841 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:01,841 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 423 [2022-01-10 11:52:01,847 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:01,847 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 413 treesize of output 346