/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_SUM.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:24:17,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:24:17,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:24:17,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:24:17,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:24:17,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:24:17,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:24:17,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:24:17,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:24:17,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:24:17,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:24:17,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:24:17,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:24:17,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:24:17,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:24:17,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:24:17,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:24:17,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:24:17,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:24:17,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:24:17,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:24:17,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:24:17,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:24:17,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:24:17,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:24:17,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:24:17,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:24:17,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:24:17,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:24:17,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:24:17,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:24:17,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:24:17,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:24:17,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:24:17,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:24:17,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:24:17,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:24:17,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:24:17,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:24:17,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:24:17,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:24:17,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:24:17,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:24:17,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:24:17,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:24:17,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:24:17,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:24:17,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:24:17,261 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:24:17,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:24:17,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:24:17,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:24:17,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:24:17,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:24:17,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:24:17,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:24:17,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:17,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:24:17,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:24:17,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:24:17,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:24:17,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:24:17,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:24:17,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:24:17,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:24:17,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:24:17,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:24:17,267 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:24:17,267 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:24:17,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:24:17,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:24:17,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:24:17,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:24:17,475 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:24:17,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2022-01-11 05:24:17,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dae29b02/3b0a8c7ba51d45ea8ec19ee9ee62cafa/FLAG9495eee80 [2022-01-11 05:24:17,944 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:24:17,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2022-01-11 05:24:17,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dae29b02/3b0a8c7ba51d45ea8ec19ee9ee62cafa/FLAG9495eee80 [2022-01-11 05:24:17,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dae29b02/3b0a8c7ba51d45ea8ec19ee9ee62cafa [2022-01-11 05:24:17,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:24:17,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:24:17,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:17,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:24:17,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:24:17,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:17" (1/1) ... [2022-01-11 05:24:17,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5610ff78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:17, skipping insertion in model container [2022-01-11 05:24:17,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:17" (1/1) ... [2022-01-11 05:24:17,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:24:18,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:24:18,302 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-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2022-01-11 05:24:18,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:18,320 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:24:18,364 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-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2022-01-11 05:24:18,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:18,388 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:24:18,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18 WrapperNode [2022-01-11 05:24:18,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:18,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:18,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:24:18,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:24:18,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,439 INFO L137 Inliner]: procedures = 125, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-01-11 05:24:18,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:18,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:24:18,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:24:18,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:24:18,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:24:18,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:24:18,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:24:18,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:24:18,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (1/1) ... [2022-01-11 05:24:18,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:18,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:18,513 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-11 05:24:18,522 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-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:24:18,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:24:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:24:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:24:18,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:24:18,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:24:18,628 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:24:18,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:24:19,122 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:24:19,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:24:19,128 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-11 05:24:19,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19 BoogieIcfgContainer [2022-01-11 05:24:19,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:24:19,130 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:24:19,130 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:24:19,131 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:24:19,133 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19" (1/1) ... [2022-01-11 05:24:19,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:19 BasicIcfg [2022-01-11 05:24:19,258 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:24:19,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:24:19,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:24:19,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:24:19,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:24:17" (1/4) ... [2022-01-11 05:24:19,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b10af8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:18" (2/4) ... [2022-01-11 05:24:19,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b10af8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:19" (3/4) ... [2022-01-11 05:24:19,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b10af8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:24:19, skipping insertion in model container [2022-01-11 05:24:19,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:19" (4/4) ... [2022-01-11 05:24:19,264 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.iTransformedIcfg [2022-01-11 05:24:19,268 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:24:19,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:24:19,314 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:24:19,326 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-11 05:24:19,326 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:24:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 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-11 05:24:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:24:19,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:19,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:19,345 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1999168892, now seen corresponding path program 1 times [2022-01-11 05:24:19,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:19,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884608328] [2022-01-11 05:24:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:19,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:19,543 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-11 05:24:19,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:19,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884608328] [2022-01-11 05:24:19,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884608328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:19,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:19,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:24:19,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104914618] [2022-01-11 05:24:19,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:19,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:24:19,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:19,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:24:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:24:19,581 INFO L87 Difference]: Start difference. First operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-11 05:24:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:19,600 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2022-01-11 05:24:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:24:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-11 05:24:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:19,607 INFO L225 Difference]: With dead ends: 88 [2022-01-11 05:24:19,608 INFO L226 Difference]: Without dead ends: 38 [2022-01-11 05:24:19,610 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-11 05:24:19,613 INFO L933 BasicCegarLoop]: 63 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, 63 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-11 05:24:19,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-11 05:24:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-11 05:24:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-01-11 05:24:19,671 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 16 [2022-01-11 05:24:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:19,671 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-01-11 05:24:19,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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-11 05:24:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-01-11 05:24:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:24:19,674 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:19,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:19,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:24:19,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 865918013, now seen corresponding path program 1 times [2022-01-11 05:24:19,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989740917] [2022-01-11 05:24:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:19,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:19,747 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-11 05:24:19,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:19,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989740917] [2022-01-11 05:24:19,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989740917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:19,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:19,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:19,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434004833] [2022-01-11 05:24:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:19,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:24:19,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:24:19,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:24:19,750 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:19,765 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2022-01-11 05:24:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:24:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:24:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:19,767 INFO L225 Difference]: With dead ends: 64 [2022-01-11 05:24:19,767 INFO L226 Difference]: Without dead ends: 46 [2022-01-11 05:24:19,768 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-11 05:24:19,769 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:19,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:19,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-11 05:24:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-11 05:24:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-01-11 05:24:19,775 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 18 [2022-01-11 05:24:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:19,776 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-01-11 05:24:19,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-11 05:24:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-01-11 05:24:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:24:19,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:19,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:19,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:24:19,778 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1233113289, now seen corresponding path program 1 times [2022-01-11 05:24:19,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:19,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731762012] [2022-01-11 05:24:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:19,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:19,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:19,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731762012] [2022-01-11 05:24:19,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731762012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:19,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:19,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:19,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301195471] [2022-01-11 05:24:19,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:19,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:24:19,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:24:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:24:19,851 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:19,870 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-01-11 05:24:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:24:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-11 05:24:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:19,873 INFO L225 Difference]: With dead ends: 82 [2022-01-11 05:24:19,873 INFO L226 Difference]: Without dead ends: 48 [2022-01-11 05:24:19,877 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-11 05:24:19,879 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:19,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-11 05:24:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-11 05:24:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2022-01-11 05:24:19,886 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 24 [2022-01-11 05:24:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:19,887 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2022-01-11 05:24:19,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-01-11 05:24:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:24:19,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:19,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:19,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:24:19,888 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2064781654, now seen corresponding path program 1 times [2022-01-11 05:24:19,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:19,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838271916] [2022-01-11 05:24:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:19,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,082 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-11 05:24:20,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838271916] [2022-01-11 05:24:20,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838271916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:20,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786809243] [2022-01-11 05:24:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:20,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:20,087 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,261 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-11 05:24:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:24:20,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-11 05:24:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,263 INFO L225 Difference]: With dead ends: 71 [2022-01-11 05:24:20,263 INFO L226 Difference]: Without dead ends: 67 [2022-01-11 05:24:20,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:24:20,264 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-11 05:24:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-01-11 05:24:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 05:24:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2022-01-11 05:24:20,270 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 24 [2022-01-11 05:24:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,270 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2022-01-11 05:24:20,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-01-11 05:24:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:24:20,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,272 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:24:20,272 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 6081297, now seen corresponding path program 1 times [2022-01-11 05:24:20,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063345648] [2022-01-11 05:24:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:20,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063345648] [2022-01-11 05:24:20,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063345648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:20,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159370577] [2022-01-11 05:24:20,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:20,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:20,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:20,414 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,548 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-11 05:24:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:24:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:24:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,550 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:24:20,550 INFO L226 Difference]: Without dead ends: 65 [2022-01-11 05:24:20,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:24:20,551 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-11 05:24:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-01-11 05:24:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2022-01-11 05:24:20,558 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 26 [2022-01-11 05:24:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,558 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2022-01-11 05:24:20,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-01-11 05:24:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:24:20,559 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,559 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:24:20,559 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1915639696, now seen corresponding path program 1 times [2022-01-11 05:24:20,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536460476] [2022-01-11 05:24:20,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:20,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:20,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536460476] [2022-01-11 05:24:20,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536460476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:20,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:20,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:24:20,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007727714] [2022-01-11 05:24:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:20,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:20,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:20,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:20,703 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:20,817 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-11 05:24:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:24:20,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-11 05:24:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:20,818 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:24:20,818 INFO L226 Difference]: Without dead ends: 62 [2022-01-11 05:24:20,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:24:20,819 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:20,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 146 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-11 05:24:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-11 05:24:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 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-11 05:24:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2022-01-11 05:24:20,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 26 [2022-01-11 05:24:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:20,825 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2022-01-11 05:24:20,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2022-01-11 05:24:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:24:20,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:20,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:20,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 05:24:20,826 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1948184160, now seen corresponding path program 1 times [2022-01-11 05:24:20,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:20,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378630113] [2022-01-11 05:24:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:20,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:21,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:21,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378630113] [2022-01-11 05:24:21,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378630113] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:21,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945380816] [2022-01-11 05:24:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:21,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:21,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:21,117 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-11 05:24:21,118 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-11 05:24:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:21,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-11 05:24:21,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:21,462 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-11 05:24:21,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:21,536 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-11 05:24:21,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:21,614 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:21,614 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-11 05:24:21,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:21,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:21,919 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 15 treesize of output 10 [2022-01-11 05:24:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:21,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:22,848 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) (= .cse0 2)))) is different from false [2022-01-11 05:24:24,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 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_197)))) (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 (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-11 05:24:24,040 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 543 treesize of output 527 [2022-01-11 05:24:24,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:24,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945380816] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:24,960 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:24,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2022-01-11 05:24:24,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252473255] [2022-01-11 05:24:24,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:24,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-11 05:24:24,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-11 05:24:24,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=310, Unknown=2, NotChecked=74, Total=462 [2022-01-11 05:24:24,963 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-11 05:24:26,199 WARN L838 $PredicateComparison]: unable to prove that (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) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 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_197)))) (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 (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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|) (<= 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) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:28,204 WARN L838 $PredicateComparison]: unable to prove that (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) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 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_197)))) (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 (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |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|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |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|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:29,148 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) (= .cse0 2)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= 2 (select .cse1 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 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-11 05:24:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:29,300 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2022-01-11 05:24:29,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:24:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:24:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:29,302 INFO L225 Difference]: With dead ends: 92 [2022-01-11 05:24:29,302 INFO L226 Difference]: Without dead ends: 86 [2022-01-11 05:24:29,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=101, Invalid=420, Unknown=5, NotChecked=230, Total=756 [2022-01-11 05:24:29,303 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:29,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 477 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2022-01-11 05:24:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-11 05:24:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2022-01-11 05:24:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 05:24:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-01-11 05:24:29,308 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 27 [2022-01-11 05:24:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:29,309 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-01-11 05:24:29,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-11 05:24:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-01-11 05:24:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:24:29,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:29,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:29,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:29,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:29,511 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2058372434, now seen corresponding path program 1 times [2022-01-11 05:24:29,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:29,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489018244] [2022-01-11 05:24:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:29,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:29,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:29,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489018244] [2022-01-11 05:24:29,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489018244] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:29,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7031910] [2022-01-11 05:24:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:29,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:29,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:29,752 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-11 05:24:29,756 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-11 05:24:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:29,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-11 05:24:29,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:29,940 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-11 05:24:30,010 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-11 05:24:30,027 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:30,028 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 16 treesize of output 14 [2022-01-11 05:24:30,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:30,084 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-11 05:24:30,140 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-11 05:24:30,181 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-11 05:24:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:30,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:30,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_280) |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-11 05:24:30,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 Int) (v_ArrVal_280 (Array Int Int))) (= (select (select (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_277)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_280) |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-11 05:24:30,279 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:30,279 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 25 treesize of output 31 [2022-01-11 05:24:30,288 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:30,288 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 30 treesize of output 33 [2022-01-11 05:24:30,292 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 7 [2022-01-11 05:24:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:30,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7031910] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:30,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:30,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-01-11 05:24:30,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344482457] [2022-01-11 05:24:30,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:30,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:24:30,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:24:30,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=278, Unknown=2, NotChecked=70, Total=420 [2022-01-11 05:24:30,447 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:24:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:30,847 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-01-11 05:24:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:24:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-11 05:24:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:30,848 INFO L225 Difference]: With dead ends: 101 [2022-01-11 05:24:30,848 INFO L226 Difference]: Without dead ends: 97 [2022-01-11 05:24:30,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=471, Unknown=2, NotChecked=94, Total=702 [2022-01-11 05:24:30,849 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:30,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 393 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 183 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-01-11 05:24:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-11 05:24:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-01-11 05:24:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 05:24:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-01-11 05:24:30,856 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 27 [2022-01-11 05:24:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:30,857 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-01-11 05:24:30,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:24:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-01-11 05:24:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:24:30,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:30,858 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:30,886 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-11 05:24:31,083 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,SelfDestructingSolverStorable7 [2022-01-11 05:24:31,084 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1495155142, now seen corresponding path program 1 times [2022-01-11 05:24:31,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278516684] [2022-01-11 05:24:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:31,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:31,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278516684] [2022-01-11 05:24:31,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278516684] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368001110] [2022-01-11 05:24:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:31,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:31,363 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-11 05:24:31,365 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-11 05:24:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:31,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-11 05:24:31,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:31,682 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-11 05:24:31,692 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-11 05:24:31,763 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:24:31,764 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-11 05:24:31,772 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-11 05:24:31,786 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-11 05:24:31,786 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 56 treesize of output 64 [2022-01-11 05:24:31,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 29 treesize of output 17 [2022-01-11 05:24:31,820 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 32 treesize of output 14 [2022-01-11 05:24:31,971 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 73 treesize of output 57 [2022-01-11 05:24:31,974 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 68 treesize of output 36 [2022-01-11 05:24:32,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:32,129 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:32,130 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-11 05:24:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:32,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:32,274 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:32,274 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-11 05:24:32,359 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:32,359 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-11 05:24:32,365 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:32,365 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-11 05:24:32,374 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:32,374 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-11 05:24:32,387 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:32,387 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-11 05:24:32,394 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-11 05:24:32,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 39 treesize of output 33 [2022-01-11 05:24:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:32,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368001110] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:32,588 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:32,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-01-11 05:24:32,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293907098] [2022-01-11 05:24:32,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:32,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-11 05:24:32,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-11 05:24:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-01-11 05:24:32,590 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:33,168 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2022-01-11 05:24:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 05:24:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-11 05:24:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:33,170 INFO L225 Difference]: With dead ends: 78 [2022-01-11 05:24:33,170 INFO L226 Difference]: Without dead ends: 74 [2022-01-11 05:24:33,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-01-11 05:24:33,171 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:33,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 367 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2022-01-11 05:24:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-11 05:24:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2022-01-11 05:24:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 05:24:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-01-11 05:24:33,177 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 29 [2022-01-11 05:24:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:33,177 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-01-11 05:24:33,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-01-11 05:24:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:24:33,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:33,178 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:33,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:33,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:33,406 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1858211827, now seen corresponding path program 1 times [2022-01-11 05:24:33,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:33,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782620071] [2022-01-11 05:24:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:33,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:33,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:33,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782620071] [2022-01-11 05:24:33,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782620071] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:33,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541974889] [2022-01-11 05:24:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:33,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:33,618 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-11 05:24:33,618 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-11 05:24:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:33,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-11 05:24:33,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:33,976 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-11 05:24:34,053 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:34,054 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 16 treesize of output 14 [2022-01-11 05:24:34,105 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-11 05:24:34,119 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-11 05:24:34,196 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:24:34,196 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 76 treesize of output 73 [2022-01-11 05:24:34,200 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 50 treesize of output 52 [2022-01-11 05:24:34,204 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 35 treesize of output 23 [2022-01-11 05:24:34,269 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 47 treesize of output 23 [2022-01-11 05:24:34,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-11 05:24:34,284 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-11 05:24:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:34,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:34,378 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 91 treesize of output 65 [2022-01-11 05:24:34,384 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_434) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_435) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|))) is different from false [2022-01-11 05:24:34,407 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:34,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-11 05:24:34,414 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:34,414 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 46 treesize of output 41 [2022-01-11 05:24:34,417 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 13 treesize of output 7 [2022-01-11 05:24:34,450 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-11 05:24:34,451 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-11 05:24:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-11 05:24:34,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541974889] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:34,566 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:34,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2022-01-11 05:24:34,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776235444] [2022-01-11 05:24:34,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:34,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:24:34,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:24:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2022-01-11 05:24:34,569 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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-11 05:24:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:35,116 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2022-01-11 05:24:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:24:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-11 05:24:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:35,117 INFO L225 Difference]: With dead ends: 91 [2022-01-11 05:24:35,117 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 05:24:35,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=647, Unknown=1, NotChecked=54, Total=870 [2022-01-11 05:24:35,118 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 227 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:35,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 296 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 278 Invalid, 0 Unknown, 111 Unchecked, 0.3s Time] [2022-01-11 05:24:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 05:24:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2022-01-11 05:24:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 05:24:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-01-11 05:24:35,130 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 29 [2022-01-11 05:24:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:35,130 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-01-11 05:24:35,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 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-11 05:24:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-01-11 05:24:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:24:35,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:35,136 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:35,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:35,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:35,359 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1798064874, now seen corresponding path program 2 times [2022-01-11 05:24:35,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:35,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743782935] [2022-01-11 05:24:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:35,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:35,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743782935] [2022-01-11 05:24:35,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743782935] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941902751] [2022-01-11 05:24:35,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:24:35,540 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:35,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:35,544 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-11 05:24:35,547 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-11 05:24:35,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:24:35,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:35,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-11 05:24:35,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:35,879 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-11 05:24:35,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:35,946 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-11 05:24:35,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:35,990 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-11 05:24:35,990 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 18 [2022-01-11 05:24:36,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:36,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:36,064 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:24:36,064 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-11 05:24:36,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:36,138 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:36,138 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-11 05:24:36,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:36,378 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:36,378 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 15 treesize of output 10 [2022-01-11 05:24:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:24:36,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:38,460 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) (= .cse0 2)))) is different from false [2022-01-11 05:24:39,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_546 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_546)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |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 (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-11 05:24:41,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int) (v_ArrVal_546 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_546)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 0)) (= .cse0 2)))) is different from false [2022-01-11 05:24:43,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_540 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33| Int) (v_ArrVal_546 Int)) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse2 (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_540)))) (store .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33| (store (store (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_546))))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 0)) (= 2 .cse0)))) is different from false [2022-01-11 05:24:45,802 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 16343 treesize of output 16215 [2022-01-11 05:24:46,462 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-11 05:24:46,463 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:24:46,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-01-11 05:24:46,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626965110] [2022-01-11 05:24:46,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:46,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:24:46,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:46,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:24:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=459, Unknown=4, NotChecked=188, Total=756 [2022-01-11 05:24:46,464 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-11 05:24:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:46,633 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2022-01-11 05:24:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:24:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 05:24:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:46,634 INFO L225 Difference]: With dead ends: 89 [2022-01-11 05:24:46,634 INFO L226 Difference]: Without dead ends: 83 [2022-01-11 05:24:46,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=124, Invalid=538, Unknown=4, NotChecked=204, Total=870 [2022-01-11 05:24:46,636 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:46,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 200 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-11 05:24:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2022-01-11 05:24:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 0 states have call successors, (0), 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-11 05:24:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2022-01-11 05:24:46,641 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 30 [2022-01-11 05:24:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:46,642 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2022-01-11 05:24:46,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-11 05:24:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-01-11 05:24:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:24:46,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:46,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:46,672 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-11 05:24:46,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-11 05:24:46,872 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:46,872 INFO L85 PathProgramCache]: Analyzing trace with hash 388271140, now seen corresponding path program 1 times [2022-01-11 05:24:46,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:46,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396664780] [2022-01-11 05:24:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:46,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:47,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396664780] [2022-01-11 05:24:47,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396664780] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:47,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027021648] [2022-01-11 05:24:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:47,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:47,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:47,228 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-11 05:24:47,230 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-11 05:24:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:47,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-11 05:24:47,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:47,390 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-11 05:24:47,421 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:47,421 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 16 treesize of output 14 [2022-01-11 05:24:47,426 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-11 05:24:47,450 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 19 treesize of output 18 [2022-01-11 05:24:47,470 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-11 05:24:47,521 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-11 05:24:47,561 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:47,561 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-11 05:24:47,678 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 22 treesize of output 10 [2022-01-11 05:24:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:47,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:49,179 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 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-11 05:24:49,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |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 (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-11 05:24:49,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) is different from false [2022-01-11 05:24:49,410 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| 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_654)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (and (<= .cse0 3) (< 2 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) is different from false [2022-01-11 05:24:49,511 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:49,511 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-11 05:24:49,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:49,534 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-11 05:24:49,558 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-11 05:24:49,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,814 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 14 treesize of output 12 [2022-01-11 05:24:49,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:49,911 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:24:49,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:49,962 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 96 treesize of output 90 [2022-01-11 05:24:50,167 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 56 treesize of output 52 [2022-01-11 05:24:50,207 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 40 treesize of output 36 [2022-01-11 05:24:50,365 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 40 treesize of output 36 [2022-01-11 05:24:50,445 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 93 treesize of output 87 [2022-01-11 05:24:50,742 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-11 05:24:51,018 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:51,019 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 38 treesize of output 38 [2022-01-11 05:24:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-11 05:24:51,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027021648] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:51,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:51,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-11 05:24:51,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167702764] [2022-01-11 05:24:51,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:51,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:24:51,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:24:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=349, Unknown=4, NotChecked=164, Total=600 [2022-01-11 05:24:51,131 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:24:51,279 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|)) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) (= (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|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:51,287 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|)) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:51,291 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_~t~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |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 (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3)))))) is different from false [2022-01-11 05:24:53,160 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 1) (and (< 2 .cse0) (<= .cse0 3))))) (= |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|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:53,244 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-01-11 05:24:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 05:24:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 05:24:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:53,245 INFO L225 Difference]: With dead ends: 97 [2022-01-11 05:24:53,245 INFO L226 Difference]: Without dead ends: 93 [2022-01-11 05:24:53,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=121, Invalid=455, Unknown=8, NotChecked=408, Total=992 [2022-01-11 05:24:53,246 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:53,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 466 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-01-11 05:24:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-11 05:24:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-01-11 05:24:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 0 states have call successors, (0), 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-11 05:24:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2022-01-11 05:24:53,252 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 30 [2022-01-11 05:24:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:53,252 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2022-01-11 05:24:53,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:24:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2022-01-11 05:24:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 05:24:53,253 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:53,253 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:53,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:53,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:53,480 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 99860438, now seen corresponding path program 2 times [2022-01-11 05:24:53,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390447861] [2022-01-11 05:24:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:53,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:24:53,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390447861] [2022-01-11 05:24:53,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390447861] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:53,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238389542] [2022-01-11 05:24:53,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:24:53,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:53,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:53,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:53,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 05:24:53,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:24:53,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:53,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-11 05:24:53,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:53,981 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-11 05:24:54,030 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-11 05:24:54,045 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:24:54,045 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 22 treesize of output 24 [2022-01-11 05:24:54,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:54,100 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-11 05:24:54,141 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:24:54,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-01-11 05:24:54,147 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-11 05:24:54,188 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-11 05:24:54,230 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-11 05:24:54,275 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-11 05:24:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:54,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:54,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_771) |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-11 05:24:54,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |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-11 05:24:54,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_771) |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-11 05:24:54,422 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:24:54,422 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 28 treesize of output 34 [2022-01-11 05:24:54,433 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:54,433 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 122 treesize of output 121 [2022-01-11 05:24:54,440 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 106 treesize of output 98 [2022-01-11 05:24:54,445 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 98 treesize of output 94 [2022-01-11 05:24:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-11 05:24:54,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238389542] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:54,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:54,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-01-11 05:24:54,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340120954] [2022-01-11 05:24:54,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:54,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 05:24:54,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 05:24:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=417, Unknown=5, NotChecked=132, Total=650 [2022-01-11 05:24:54,858 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 05:24:55,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (let ((.cse1 (= (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)) (.cse0 (not .cse3)) (.cse5 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and .cse0 (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |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_~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) .cse1 (let ((.cse2 (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) (.cse4 (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0))) (or (and .cse2 .cse3 .cse1 .cse4 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)) (and .cse0 .cse2 .cse4 (= (select .cse5 0) 1)))) (= (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)))) is different from false [2022-01-11 05:24:55,386 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (let ((.cse1 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse0 (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) (.cse2 (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0))) (or (and .cse0 .cse1 (= (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) .cse2 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)) (and (not .cse1) .cse0 .cse2 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-11 05:24:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:55,927 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-01-11 05:24:55,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-11 05:24:55,927 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-11 05:24:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:55,929 INFO L225 Difference]: With dead ends: 169 [2022-01-11 05:24:55,929 INFO L226 Difference]: Without dead ends: 161 [2022-01-11 05:24:55,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1449, Unknown=9, NotChecked=430, Total=2256 [2022-01-11 05:24:55,930 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 135 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:55,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 646 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 288 Invalid, 0 Unknown, 357 Unchecked, 0.3s Time] [2022-01-11 05:24:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-11 05:24:55,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 87. [2022-01-11 05:24:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 0 states have call successors, (0), 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-11 05:24:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2022-01-11 05:24:55,937 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 30 [2022-01-11 05:24:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:55,937 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2022-01-11 05:24:55,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-11 05:24:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2022-01-11 05:24:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 05:24:55,938 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:55,938 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:55,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:56,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:56,160 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:56,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1995755253, now seen corresponding path program 1 times [2022-01-11 05:24:56,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450151281] [2022-01-11 05:24:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:56,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:56,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:56,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450151281] [2022-01-11 05:24:56,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450151281] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:56,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636102663] [2022-01-11 05:24:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:56,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:56,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:56,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 05:24:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:56,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-11 05:24:56,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:56,654 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-11 05:24:56,662 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-11 05:24:56,727 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:24:56,728 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-11 05:24:56,733 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-11 05:24:56,746 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-11 05:24:56,746 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 56 treesize of output 64 [2022-01-11 05:24:56,755 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-11 05:24:56,767 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-11 05:24:56,779 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 32 treesize of output 14 [2022-01-11 05:24:56,919 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 73 treesize of output 57 [2022-01-11 05:24:56,922 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 68 treesize of output 36 [2022-01-11 05:24:57,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:57,036 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:57,037 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-11 05:24:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:57,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:57,159 INFO L353 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2022-01-11 05:24:57,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2022-01-11 05:24:57,307 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:57,307 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 107 treesize of output 95 [2022-01-11 05:24:57,320 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:57,321 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 83 treesize of output 71 [2022-01-11 05:24:57,331 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:57,331 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 170 treesize of output 101 [2022-01-11 05:24:57,346 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:57,347 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 119 treesize of output 114 [2022-01-11 05:24:57,352 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 91 treesize of output 79 [2022-01-11 05:24:57,356 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 79 treesize of output 67 [2022-01-11 05:24:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:57,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636102663] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:57,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:57,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-01-11 05:24:57,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987162256] [2022-01-11 05:24:57,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:57,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-11 05:24:57,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-11 05:24:57,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-01-11 05:24:57,655 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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-11 05:24:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:58,186 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2022-01-11 05:24:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-11 05:24:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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 31 [2022-01-11 05:24:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:58,187 INFO L225 Difference]: With dead ends: 98 [2022-01-11 05:24:58,187 INFO L226 Difference]: Without dead ends: 85 [2022-01-11 05:24:58,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2022-01-11 05:24:58,189 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:58,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 422 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 174 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2022-01-11 05:24:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-11 05:24:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-01-11 05:24:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 0 states have call successors, (0), 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-11 05:24:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2022-01-11 05:24:58,194 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 31 [2022-01-11 05:24:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:58,194 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2022-01-11 05:24:58,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 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-11 05:24:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2022-01-11 05:24:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 05:24:58,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:58,195 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:58,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:58,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-11 05:24:58,399 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:58,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash 990631944, now seen corresponding path program 2 times [2022-01-11 05:24:58,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:58,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948241497] [2022-01-11 05:24:58,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:58,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:58,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:58,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948241497] [2022-01-11 05:24:58,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948241497] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:58,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132383392] [2022-01-11 05:24:58,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:24:58,612 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:58,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:58,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:58,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 05:24:58,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:24:58,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:58,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-11 05:24:58,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:58,899 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-11 05:24:58,906 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-11 05:24:58,965 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:24:58,965 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 44 treesize of output 47 [2022-01-11 05:24:58,969 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 19 treesize of output 13 [2022-01-11 05:24:58,981 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-11 05:24:58,982 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 35 [2022-01-11 05:24:58,992 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 17 treesize of output 13 [2022-01-11 05:24:59,007 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 15 [2022-01-11 05:24:59,018 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-11 05:24:59,097 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 23 treesize of output 15 [2022-01-11 05:24:59,100 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 26 treesize of output 14 [2022-01-11 05:24:59,133 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:59,134 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-11 05:24:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:59,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:59,253 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-01-11 05:24:59,254 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 75 treesize of output 45 [2022-01-11 05:24:59,319 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:59,319 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-11 05:24:59,323 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:59,323 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-11 05:24:59,332 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:59,333 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-11 05:24:59,350 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:59,350 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-11 05:24:59,354 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-11 05:24:59,357 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-11 05:24:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:24:59,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132383392] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:59,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:59,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-01-11 05:24:59,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690236224] [2022-01-11 05:24:59,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:59,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-11 05:24:59,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-11 05:24:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-01-11 05:24:59,494 INFO L87 Difference]: Start difference. First operand 84 states and 114 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-11 05:25:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:00,077 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2022-01-11 05:25:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 05:25:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-11 05:25:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:00,078 INFO L225 Difference]: With dead ends: 105 [2022-01-11 05:25:00,079 INFO L226 Difference]: Without dead ends: 95 [2022-01-11 05:25:00,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2022-01-11 05:25:00,080 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:00,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 497 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 380 Invalid, 0 Unknown, 39 Unchecked, 0.3s Time] [2022-01-11 05:25:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-11 05:25:00,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-01-11 05:25:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 0 states have call successors, (0), 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-11 05:25:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2022-01-11 05:25:00,086 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 31 [2022-01-11 05:25:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:00,087 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2022-01-11 05:25:00,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 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-11 05:25:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2022-01-11 05:25:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 05:25:00,087 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:00,088 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:00,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:00,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-11 05:25:00,303 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1052694951, now seen corresponding path program 1 times [2022-01-11 05:25:00,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:00,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108540853] [2022-01-11 05:25:00,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:00,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:25:00,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:00,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108540853] [2022-01-11 05:25:00,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108540853] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:00,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597429629] [2022-01-11 05:25:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:00,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:00,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:00,445 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:00,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-11 05:25:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:00,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-11 05:25:00,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:00,605 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-11 05:25:00,675 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:00,675 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 16 treesize of output 14 [2022-01-11 05:25:00,682 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-11 05:25:00,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:00,735 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-11 05:25:00,782 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-11 05:25:00,805 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-11 05:25:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:25:00,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:00,946 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:25:00,946 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 26 treesize of output 32 [2022-01-11 05:25:00,953 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:00,953 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 33 treesize of output 36 [2022-01-11 05:25:00,956 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 20 treesize of output 18 [2022-01-11 05:25:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:25:01,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597429629] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:01,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:01,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-01-11 05:25:01,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332858117] [2022-01-11 05:25:01,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:01,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-11 05:25:01,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-11 05:25:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-01-11 05:25:01,045 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 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-11 05:25:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:01,317 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-01-11 05:25:01,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:25:01,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 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 31 [2022-01-11 05:25:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:01,318 INFO L225 Difference]: With dead ends: 98 [2022-01-11 05:25:01,318 INFO L226 Difference]: Without dead ends: 85 [2022-01-11 05:25:01,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2022-01-11 05:25:01,319 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:01,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 426 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 159 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2022-01-11 05:25:01,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-11 05:25:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2022-01-11 05:25:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 05:25:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2022-01-11 05:25:01,323 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 31 [2022-01-11 05:25:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:01,323 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2022-01-11 05:25:01,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 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-11 05:25:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2022-01-11 05:25:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 05:25:01,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:01,324 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:01,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-11 05:25:01,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-11 05:25:01,527 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1035557936, now seen corresponding path program 2 times [2022-01-11 05:25:01,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:01,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294086145] [2022-01-11 05:25:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:01,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:01,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294086145] [2022-01-11 05:25:01,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294086145] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455165897] [2022-01-11 05:25:01,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:01,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:01,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:01,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-11 05:25:02,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:02,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:02,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-11 05:25:02,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:02,145 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-11 05:25:02,196 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:02,196 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-11 05:25:02,256 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-11 05:25:02,265 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 11 treesize of output 7 [2022-01-11 05:25:02,318 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:02,318 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 22 [2022-01-11 05:25:02,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:02,329 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 28 treesize of output 26 [2022-01-11 05:25:02,340 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-11 05:25:02,424 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:02,424 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 107 treesize of output 98 [2022-01-11 05:25:02,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:02,431 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 43 treesize of output 38 [2022-01-11 05:25:02,435 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 76 treesize of output 58 [2022-01-11 05:25:02,541 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:25:02,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 95 treesize of output 93 [2022-01-11 05:25:02,567 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-01-11 05:25:02,568 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 90 [2022-01-11 05:25:02,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:02,585 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-11 05:25:02,586 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 1 case distinctions, treesize of input 31 treesize of output 36 [2022-01-11 05:25:02,701 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 38 treesize of output 14 [2022-01-11 05:25:02,736 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 98 treesize of output 86 [2022-01-11 05:25:03,117 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 177 treesize of output 155 [2022-01-11 05:25:03,745 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 271 treesize of output 239 [2022-01-11 05:25:03,782 INFO L353 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2022-01-11 05:25:03,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 246 treesize of output 157 [2022-01-11 05:25:04,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:04,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:04,363 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-11 05:25:04,363 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 22 treesize of output 17 [2022-01-11 05:25:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:04,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:06,588 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (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_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1)) (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))))) (or (= 3 .cse0) (= 2 .cse0)))) (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|) 2)))) is different from false [2022-01-11 05:25:06,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (let ((.cse4 (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|) .cse3 v_ArrVal_1114)))) (store .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse1 (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) (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|) .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse1 2) (= .cse1 3)))))) is different from false [2022-01-11 05:25:06,694 INFO L353 Elim1Store]: treesize reduction 4, result has 91.3 percent of original size [2022-01-11 05:25:06,694 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 2295 treesize of output 2177 [2022-01-11 05:25:06,724 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:06,724 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 1515 treesize of output 1294 [2022-01-11 05:25:10,975 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 30 treesize of output 12 [2022-01-11 05:25:11,018 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 21 treesize of output 9 [2022-01-11 05:25:12,053 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 30 treesize of output 12 [2022-01-11 05:25:12,083 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 21 treesize of output 9 [2022-01-11 05:25:12,289 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 30 treesize of output 12 [2022-01-11 05:25:12,323 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 21 treesize of output 9 [2022-01-11 05:25:12,499 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 21 treesize of output 9 [2022-01-11 05:25:12,690 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 21 treesize of output 9 [2022-01-11 05:25:12,761 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 30 treesize of output 12 [2022-01-11 05:25:12,854 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 30 treesize of output 12 [2022-01-11 05:25:15,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select v_arrayElimArr_13 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_13) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))) (or (not (<= .cse0 0)) (and (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 .cse0)) (let ((.cse3 (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (and (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) .cse3) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse2) .cse3))) (and (= .cse0 .cse2) (= .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|)))))) is different from false [2022-01-11 05:25:15,054 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:15,054 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 212 treesize of output 188 [2022-01-11 05:25:15,060 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:15,060 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 176 treesize of output 152 [2022-01-11 05:25:15,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:15,072 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 580 treesize of output 543 [2022-01-11 05:25:15,087 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:15,087 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 540 treesize of output 448 [2022-01-11 05:25:15,093 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 424 treesize of output 352 [2022-01-11 05:25:15,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:15,109 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 516 treesize of output 503 [2022-01-11 05:25:15,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 480 treesize of output 444 [2022-01-11 05:25:15,133 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 444 treesize of output 426 [2022-01-11 05:25:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-11 05:25:16,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455165897] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:16,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:16,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2022-01-11 05:25:16,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300744119] [2022-01-11 05:25:16,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:16,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-11 05:25:16,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-11 05:25:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-01-11 05:25:16,714 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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-11 05:25:17,127 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4))) (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) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (<= 0 .cse0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse6 (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|) .cse5 v_ArrVal_1114)))) (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse3 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .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|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse3 2) (= .cse3 3)))))) (<= .cse0 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-11 05:25:17,165 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4))) (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) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (<= 0 .cse0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse6 (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|) .cse5 v_ArrVal_1114)))) (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse3 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .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|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse3 2) (= .cse3 3)))))) (<= .cse0 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (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_~a~0#1.offsetInt| 0))) is different from false